Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Tom Leighton Massachusetts Institute of Technology, Cambridge
Satish Rao NEC Research Institute, Princeton, NJ
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 46 Issue 6, Nov. 1999
Pages 787-832
ACM New York, NY, USA
table of contents doi>10.1145/331524.331526
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms Published by ACM 1999 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 33
· Downloads (12 Months): 347
· Downloads (cumulative): 6,676
· Citation Count: 173


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