28 search results - page 1 / 6» Approximation Algorithms for Disjoint Paths and Related Rout... |

MOR

2000

13 years 2 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 9 months ago
2009

Springer

In classical network ﬂow theory the choice of paths, on which ﬂow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...

FOCS

2005

IEEE

13 years 8 months ago
2005

IEEE

In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...

APPROX

2010

Springer

13 years 4 months ago
2010

Springer

We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...

ESA

2009

Springer

13 years 9 months ago
2009

Springer

In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a ...