Maximum flows on disjoint paths

DOI10.1007/978-3-642-15369-3_25MaRDI QIDQ3588418zbMATH OpenOpenAlexFDO

Authors Guyslain Naves, Nicolas Sonnerat, Adrian Vetta

Publication date 10 September 2010

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15369-3_25

Mathematics Subject Classification ID

Flows in graphs (05C21) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Deterministic network models in operations research (90B10)

Recommendations

• On the disjoint paths problem
• Approximation algorithms for disjoint paths and related routing and packing problems
• Edge-disjoint paths revisited
• An Approximation Algorithm for Fully Planar Edge-Disjoint Paths
• scientific article; zbMATH DE number 5899246

Cited in

(10)

• Flows over edge-disjoint mixed multipaths and applications
• On the disjoint paths problem
• The Maximum Disjoint Routing Problem
• The maximum flow problem with disjunctive constraints
• scientific article; zbMATH DE number 3908126 (Why is no real title available?)
• Non-approximability and polylogarithmic approximations of the single-sink unsplittable and confluent dynamic flow problems
• Cuts and Disjoint Paths in the Valley-Free Path Model
• A measure-theoretical max-flow problem
• Maximum \(k\)-splittable \(s, t\)-flows
• Disjoint paths in sparse graphs

This page was built for publication: Maximum flows on disjoint paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3588418)