34 search results - page 1 / 7 » An Algorithm for Node-to-Set Disjoint Paths Problem in Bi-Ro... |
IEICET
2006
14 years 11 months ago
2006
FOCS
2005
IEEE
15 years 5 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...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We consider the following well-known problem, which is called the edge-disjoint paths problem. Input: A graph G with n vertices and m edges, k pairs of vertices (s1, t1), (s2, t2)...
110
click to vote
WADS
2005
Springer
15 years 5 months ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
105
click to vote
SIAMCOMP
2010
14 years 10 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...