434 search results - page 8 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
ISPAN
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract—In real networks, disjoint paths are needed for providing protection against single link/node failure. When disjoint paths cannot be found, an alternative solution is to...
COREGRID
2007
Springer
15 years 3 months ago
2007
Springer
We address the problem of routing packets on multiple, router-disjoint, paths in the Internet using large-scale overlay networks. Multipath routing can improve Internet QoS, by rou...
102
click to vote
CN
2007
14 years 9 months ago
2007
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
GLOBECOM
2010
IEEE
14 years 7 months ago
2010
IEEE
Multi-path routing is effective to enhance network availability, by selecting multiple failure-independent paths for reaching one destination in the hope to survive individual pat...
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...