Improved Approximation Algorithms for Unsplittable Flow Problems


In the single-source unsplittable ow problem we are given a graph G; a source vertex s and a set of sinks t 1 ; : : :; t k with associated demands. We seek a single s-t i ow path for each commodity i so that the demands are satissed and the total ow routed across any edge e is bounded by its capacity c e : The problem is an NP-hard variant of max ow and a… (More)
DOI: 10.1109/SFCS.1997.646131


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.


Citations per Year

126 Citations

Semantic Scholar estimates that this publication has 126 citations based on the available data.

See our FAQ for additional information.