Maximum Flows on Disjoint Paths
Guyslain Naves, Nicolas Sonnerat, Adrian R. Vetta · Lecture notes in computer science · 2010
Cited by 1 works. doi:10.1007/978-3-642-15369-3_25
Authors
References
- Network Flows: Theory, Algorithms, and Applications.
- Combinatorial optimization. Polyhedra and efficiency.
- The directed subgraph homeomorphism problem
- Differentiable Functions and Singularities
- Single-source unsplittable flow
- On the Single-Source Unsplittable Flow Problem
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- Research Trends in Combinatorial Optimization
- The k-Splittable Flow Problem
- Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs