Using dual approximation algorithms for scheduling problems theoretical and practical results

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Dorit S. Hochbaum Univ. of California at Berkeley, Berkeley
David B. Shmoys Massachusetts Institute of Technology, Cambridge
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 34 Issue 1, Jan. 1987
Pages 144-162
ACM New York, NY, USA
table of contents doi>10.1145/7531.7535
Using dual approximation algorithms for scheduling problems theoretical and practical results Published by ACM 1987 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 15
· Downloads (12 Months): 108
· Downloads (cumulative): 1,401
· Citation Count: 146


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder