The all-or-nothing multicommodity flow problem
DOI10.1145/1007352.1007383zbMATH Open1192.68878OpenAlexW2119862441MaRDI QIDQ3580965FDOQ3580965
Authors: Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd 
Publication date: 15 August 2010
Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://repository.upenn.edu/cgi/viewcontent.cgi?article=1009&context=cis_papers
Recommendations
- The all-or-nothing multicommodity flow problem
- All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs
- The all-or-nothing flow problem in directed graphs with symmetric demand pairs
- The all-or-nothing flow problem in directed graphs with symmetric demand pairs
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)
Cited In (12)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
- Single-Sink Multicommodity Flow with Side Constraints
- A note on multiflows and treewidth
- Weighted packet selection for rechargeable links in cryptocurrency networks: complexity and approximation
- The disjoint paths problem in quadratic time
- Thresholded covering algorithms for robust and max-min optimization
- Title not available (Why is that?)
- Weighted packet selection for rechargeable links in cryptocurrency networks: complexity and approximation
- Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators
- Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators
- Survey on oblivious routing strategies
- On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms
This page was built for publication: The all-or-nothing multicommodity flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580965)
