31 search results - page 2 / 7 » Improved bounds for the unsplittable flow problem |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
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...
FOCS
2007
IEEE
13 years 9 months ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
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...
BIRTHDAY
2009
Springer
13 years 9 months ago
2009
Springer
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...