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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
118
Voted
CORR
2011
Springer
180
views
Education
»
more
CORR 2011
»
Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines
14 years 6 months ago
Download
www.cs.dartmouth.edu
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a lengt...
Lisa Fleischer, Zhenghui Wang
claim paper
Read More »