23 search results - page 1 / 5 » On disjoint paths in acyclic planar graphs |
56
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
ESA
2003
Springer
15 years 6 months ago
2003
Springer
81
Voted
FOCS
2005
IEEE
15 years 6 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...
123
Voted
AAIM
2007
Springer
15 years 5 months ago
2007
Springer
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
110
click to vote
ISAAC
2009
Springer
15 years 5 months ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...