74 search results - page 3 / 15 » A nature-inspired algorithm for the disjoint paths problem |
144
click to vote
SODA
2010
ACM
16 years 3 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)...
159
click to vote
GLOBECOM
2010
IEEE
15 years 3 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...
162
Voted
SOFSEM
2007
Springer
16 years 1 days ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
156
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
154
click to vote
CCCG
2010
15 years 7 months ago
2010
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...