On the approximability of some network design problems

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Julia Chuzhoy Computer Science and Artificial Intelligence Laboratory, MIT and, University of Pennsylvania
Anupam Gupta Carnegie Mellon University, Pittsburgh, PA
Joseph (Seffi) Naor Technion, Israel, Haifa, Israel
Amitabh Sinha University of Michigan, Ann Arbor, MI
On the approximability of some network design problems Published by ACM 2008 Article
  • Research
  • Refereed
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 35
· Downloads (cumulative): 500
· Citation Count: 6

Published in:
Cover Image
 
· Journal
ACM Transactions on Algorithms (TALG) TALG Homepage archive
Volume 4 Issue 2, May 2008
Article No. 23
ACM New York, NY, USA
table of contents doi>10.1145/1361192.1361200

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