Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
22
click to vote
SODA
2010
ACM
favorite
Email
discuss
report
171
views
Algorithms
»
more
SODA 2010
»
A deterministic truthful PTAS for scheduling related machines
14 years 5 months ago
Download
www.csc.liv.ac.uk
George Christodoulou, Annamaria Kovacs
Real-time Traffic
Deterministic Truthful Ptas
|
Discrete Algorithms
|
SODA 2010
|
claim paper
Related Content
»
Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines
»
Lower Bound for EnvyFree and Truthful Makespan Approximation on Related Machines
»
Optimal and Online Preemptive Scheduling on Uniformly Related Machines
»
Preemptive Scheduling on Selfish Machines
»
A simpler competitive analysis for scheduling equallength jobs on one machine with restart...
»
Preemptive Online Scheduling Optimal Algorithms for All Speeds
»
Blackbox reductions for costsharing mechanism design
»
Better bounds for online load balancing on unrelated machines
»
Online Scheduling with Bounded Migration
more »
Post Info
More Details (n/a)
Added
01 Mar 2010
Updated
02 Mar 2010
Type
Conference
Year
2010
Where
SODA
Authors
George Christodoulou, Annamaria Kovacs
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision