The all-or-nothing multicommodity flow problem

DOI10.1145/1007352.1007383zbMath1192.68878OpenAlexW2119862441MaRDI QIDQ3580965

Sanjeev Khanna, Chandra Chekuri, 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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)

Related Items (12)

A note on multiflows and treewidth ⋮ Thresholded covering algorithms for robust and max-min optimization ⋮ The disjoint paths problem in quadratic time ⋮ Weighted packet selection for rechargeable links in cryptocurrency networks: complexity and approximation ⋮ Weighted packet selection for rechargeable links in cryptocurrency networks: complexity and approximation ⋮ Single-Sink Multicommodity Flow with Side Constraints ⋮ Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs ⋮ On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms ⋮ Survey on Oblivious Routing Strategies ⋮ Unnamed Item ⋮ Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators ⋮ Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators

This page was built for publication: The all-or-nothing multicommodity flow problem