47 search results - page 2 / 10 » Combinatorial Algorithms for the Unsplittable Flow Problem |
ALGORITHMICA
2007
13 years 5 months ago
2007
IPCO
2001
13 years 6 months ago
2001
STOC
2006
ACM
14 years 5 months ago
2006
ACM
We study the Unsplittable Flow Problem (UFP) on a line graph, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-pol...
MOR
2000
13 years 5 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
TAMC
2009
Springer
13 years 11 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...