Sciweavers

ESA
2007
Springer
130views Algorithms» more  ESA 2007»
13 years 11 months ago
Convex Combinations of Single Source Unsplittable Flows
In the single source unsplittable flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given digraph. The deman...
Maren Martens, Fernanda Salazar, Martin Skutella