On partitioning graphs via single commodity flows

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Lorenzo Orecchia University of California, Berkeley, Berkeley, USA
Leonard J. Schulman California Institute of Technology, Pasadena, USA
Umesh V. Vazirani University of California, Berkeley, Berkeley, USA
Nisheeth K. Vishnoi IBM India Research Lab, New Delhi, India
On partitioning graphs via single commodity flows Published by ACM 2008 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 35
· Downloads (cumulative): 382
· Citation Count: 12

Published in:
Cover Image
 
· Proceeding
STOC '08 Proceedings of the 40th annual ACM symposium on Theory of computing
Pages 461-470
ACM New York, NY, USA ©2008
table of contents ISBN: 978-1-60558-047-0 doi>10.1145/1374376.1374442

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