39 search results - page 2 / 8 » Dynamic Multi-level Overlay Graphs for Shortest Paths |
107
click to vote
ALGORITHMICA
1998
14 years 9 months ago
1998
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
ESA
2004
Springer
15 years 3 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
101
click to vote
TCOS
2010
14 years 8 months ago
2010
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...