422 search results - page 2 / 85 » Shortest paths between shortest paths and independent sets |
CCCG
2003
13 years 6 months ago
2003
Suppose one has a line arrangement and one wants to find a shortest path from one point lying on a line of the arrangement to another such point. We look at a special case: the a...
AAIM
2009
Springer
13 years 11 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...
ESA
2006
Springer
13 years 8 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...
FCT
1995
Springer
13 years 8 months ago
1995
Springer
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
WADS
2007
Springer
13 years 11 months ago
2007
Springer
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...