Sciweavers

23 search results - page 1 / 5
» On the Single-Source Unsplittable Flow Problem
Sort
View
ESA
2007
Springer
130views Algorithms» more  ESA 2007»
15 years 4 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
FOCS
2000
IEEE
15 years 1 months ago
Approximating the single source unsplittable min-cost flow problem
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 ...
Martin Skutella
79
Voted
FOCS
1998
IEEE
15 years 2 months ago
On the Single-Source Unsplittable Flow Problem
Yefim Dinitz, Naveen Garg, Michel X. Goemans
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
13 years 7 days ago
Approximate duality of multicommodity multiroute flows and cuts: single source case
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 ...
Petr Kolman, Christian Scheideler
TOC
2008
104views more  TOC 2008»
14 years 9 months ago
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks
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...
Henning Bruhn, Jakub Cerný, Alexander Hall,...