The all-or-nothing multicommodity flow problem

DOI10.1145/1007352.1007383MaRDI QIDQ3580965zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(16)

• Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
• The all-or-nothing multicommodity flow problem
• A note on multiflows and treewidth
• Single-Sink Multicommodity Flow with Side Constraints
• The disjoint paths problem in quadratic time
• Weighted packet selection for rechargeable links in cryptocurrency networks: complexity and approximation
• The all-or-nothing flow problem in directed graphs with symmetric demand pairs
• Thresholded covering algorithms for robust and max-min optimization
• scientific article; zbMATH DE number 7525512 (Why is no real title available?)
• 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
• Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators
• Weighted packet selection for rechargeable links in cryptocurrency networks: complexity and approximation
• 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)