434 search results - page 6 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
215
click to vote
CJ
2011
14 years 7 months ago
2011
Ad Hoc networks are characterized by fast dynamic changes in the topology of the network. A known technique to improve QoS is to use Multipath routing where packets (voice/video/...
153
click to vote
MOBICOM
2003
ACM
15 years 9 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
138
click to vote
ISAAC
2009
Springer
15 years 8 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...
149
click to vote
SIAMCOMP
2010
15 years 2 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...
127
click to vote
APPROX
2010
Springer
15 years 5 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...