The k-Splittable Flow Problem
Georg Baier, Ekkehard Köhler, Martin Skutella · Algorithmica · 2005
Cited by 98 works. doi:10.1007/s00453-005-1167-9
Authors
References
- Network Flows
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Approximation algorithms for disjoint paths problems
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- Improved approximation algorithms for unsplittable flow problems
- Single-source unsplittable flow
- On the Single-Source Unsplittable Flow Problem
- Short paths in expander graphs
- Disjoint paths in densely embedded graphs