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)