23 search results - page 2 / 5 » On the Single-Source Unsplittable Flow Problem |
MP
2002
13 years 5 months ago
2002
We study the polyhedra of splittable and unsplittable single arc
JAL
2006
13 years 5 months ago
2006
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...
ESA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
ALGORITHMICA
2006
13 years 5 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
IPCO
2001
13 years 6 months ago
2001
