Maximum Flows on Disjoint Paths

DOI10.1007/978-3-642-15369-3_25zbMath1306.90022OpenAlexW1554852049MaRDI QIDQ3588418

Nicolas Sonnerat, Guyslain Naves, 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

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

Related Items (1)

Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems

This page was built for publication: Maximum Flows on Disjoint Paths