268 search results - page 31 / 54 » Finding the k Shortest Paths |
APPROX
2010
Springer
13 years 9 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...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Finding the occurrences of structural patterns in XML data is a key operation in XML query processing. Existing algorithms for this operation focus almost exclusively on path-patt...
SECON
2010
IEEE
13 years 5 months ago
2010
IEEE
Anypath routing has been proposed to improve the performance of unreliable wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. In thi...
ALGOSENSORS
2009
Springer
14 years 2 months ago
2009
Springer
Barrier coverage in a sensor network has the goal of ensuring that all paths through the surveillance domain joining points in some start region S to some target region T will inte...