Skip to main navigation
Skip to search
Skip to main content
Tilburg University Research Portal Home
Help & FAQ
Home
Profiles
Research output
Research units
Activities
Projects
Press/Media
Prizes
Datasets
Search by expertise, name or affiliation
New bounds for truthful scheduling on two unrelated selfish machines
Olga Kuryatnikova
,
J.C. Vera
Center Ph. D. Students
Research Group: Operations Research
Econometrics and OR
Research output
:
Contribution to journal
›
Article
›
Scientific
›
peer-review
2
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'New bounds for truthful scheduling on two unrelated selfish machines'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Truthful Scheduling
100%
Cumulative Distribution Function
100%
Monotone
50%
Piecewise
50%
Tight Bounds
50%
Min-max
50%
Scale-free
50%
Minimum Makespan
50%
Two-machine
50%
Randomized Algorithms
50%
Pointwise Approximation
50%
Approximation Ratio
50%
Best Approximation
50%
Mathematics
Cumulative Distribution Function
100%
Upper Bound
50%
Lower and upper bounds
50%
Pointwise
50%
Min-Max
50%
Best Approximation
50%