353 search results - page 2 / 71 » Two-phase Algorithms for the Parametric Shortest Path Proble... |
ESA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
FAW
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
SLS
2009
Springer
14 years 2 months ago
2009
Springer
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
AAIM
2009
Springer
14 years 2 months ago
2009
Springer
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fr´echet distance in the plane with polygonal obstacles. Distances between points are measured eithe...
AAAI
2004
13 years 9 months ago
2004
In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...