SIGN IN
SIGN UP
(Almost) optimal coordination mechanisms for unrelated machine scheduling
Full Text:
PDF
Get this Article
Authors:
Yossi Azar
Microsoft Research, Redmond and Tel-Aviv University, Tel-Aviv, Israel
Kamal Jain
Microsoft Research, Redmond
Vahab Mirrokni
Microsoft Research, Redmond
Published in:
· Proceeding
SODA '08
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Pages 323-332
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©2008
table of contents
2008 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 8
· Downloads (cumulative): 366
· Citation Count: 30
Tools and Resources
Buy this Article
Recommend the ACM DL
to your organization
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Author Tags
algorithms
approximation
approximation algorithms analysis
design
mathematics and statistics
numerical analysis
randomness, geometry and discrete structures
scheduling algorithms
sequential decision making
theory
Contact Us
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Advertisements
Powered by
Did you know the ACM DL App is now available?
Did you know your Organization can subscribe to the ACM Digital Library?
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder