Simpler and better approximation algorithms for network design

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Anupam Gupta Carnegie Mellon University, Pittsburgh, PA
Amit Kumar Lucent Bell Labs, Murray Hill, NJ
Tim Roughgarden Cornell University, Ithaca, NY
Published in:
· Proceeding
STOC '03 Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Pages 365-372
ACM New York, NY, USA ©2003
table of contents ISBN:1-58113-674-9 doi>10.1145/780542.780597
Simpler and better approximation algorithms for network design Published by ACM 2003 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 41
· Downloads (cumulative): 560
· Citation Count: 54


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