Hardness of routing with congestion in directed graphs

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Julia Chuzhoy Institute of Advanced Study, Princeton, NJ
Venkatesan Guruswami University of Washington, Seattle, WA
Sanjeev Khanna University of Pennsylvania, Philadelphia, PA
Kunal Talwar Microsoft Research SVC, Mountain View, CA
Hardness of routing with congestion in directed graphs Published by ACM 2007 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 13
· Downloads (cumulative): 257
· Citation Count: 9

Published in:
· Proceeding
STOC '07 Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Pages 165 - 178
ACM New York, NY, USA ©2007
table of contents ISBN: 978-1-59593-631-8 doi>10.1145/1250790.1250816

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