34 search results - page 2 / 7 » An Algorithm for Node-to-Set Disjoint Paths Problem in Bi-Ro... |
122
click to vote
SOFSEM
2007
Springer
15 years 9 months 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 ...
114
click to vote
ATMOS
2010
15 years 2 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
128
click to vote
ISAAC
2009
Springer
15 years 7 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...
147
click to vote
AAIM
2007
Springer
15 years 7 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...
133
click to vote
ICOIN
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...