The All-or-Nothing Multicommodity Flow Problem
From MaRDI portal
Publication:2862199
DOI10.1137/100796820zbMath1290.68054OpenAlexW1979444789MaRDI QIDQ2862199
Chandra Chekuri, F. Bruce Shepherd, Sanjeev Khanna
Publication date: 14 November 2013
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://repository.upenn.edu/cgi/viewcontent.cgi?article=1009&context=cis_papers
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items
Heterogeneous flow distribution at the peak load in the multiuser network ⋮ All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs ⋮ Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs ⋮ The all-or-nothing flow problem in directed graphs with symmetric demand pairs ⋮ A knapsack intersection hierarchy ⋮ Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators ⋮ Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators ⋮ Routing in Undirected Graphs with Constant Congestion
