83 search results - page 3 / 17 » Finding the k Shortest Simple Paths: A New Algorithm and Its... |
IWANN
1997
Springer
13 years 10 months ago
1997
Springer
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...
SIGMOD
2009
ACM
14 years 6 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
COMPGEOM
2006
ACM
14 years 21 hour ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
IPL
2010
13 years 4 months ago
2010
The Floyd-Warshall algorithm is a simple and widely used algorithm to compute shortest paths between all pairs of vertices in an edge weighted directed graph. It can also be used ...
IFIP
2004
Springer
13 years 11 months ago
2004
Springer
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...