23 search results - page 1 / 5 » On the Single-Source Unsplittable Flow Problem |
ESA
2007
Springer
15 years 4 months ago
2007
Springer
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...
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
81
Voted
FOCS
1998
IEEE
15 years 2 months ago
1998
IEEE
114
click to vote
SODA
2012
ACM
13 years 28 days ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
TOC
2008
14 years 10 months ago
2008
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...