SIGN IN
SIGN UP
The all-or-nothing multicommodity flow problem
Full Text:
PDF
Buy this Article
Authors:
Chandra Chekuri
Lucent Bell Labs, Murray Hill, NJ
Sanjeev Khanna
University of Pennsylvania, Philadelphia, PA
F. Bruce Shepherd
Lucent Bell Labs, Murray Hill, NJ
Published in:
· Proceeding
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Pages 156-165
ACM
New York, NY
, USA
©2004
table of contents
ISBN:1-58113-852-0
doi>
10.1145/1007352.1007383
2004 Article
Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 34
· Downloads (cumulative): 787
· Citation Count: 30
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
all-or-nothing multicommodity flow
approximation algorithms
combinatorics
edge disjoint paths
multicommodity flow
nonnumerical algorithms and problems
oblivious routing
online algorithms
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder