A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs

Abstract. In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter $\epsilon$ such that $0<\epsilon$ , our algorithm maintains approximate all-pairs shortest paths in an undirected planar graph G with nonnegative edge lengths. The approximate paths are guaranteed to be accurate to within a 1+ $\epsilon$ factor. The time bounds for both query and update for our algorithm is O( \epsilon -1n2/3 log2n log D) , where n is the number of nodes in G and D is the sum of its edge lengths. The time bound for the queries is worst case, while that for the additions is amortized. Our approximation algorithm is based upon a novel technique for approximately representing all-pairs shortest paths among a selected subset of the nodes by a sparse substitute graph.

[1]  Alberto Marchetti-Spaccamela,et al.  Dynamic algorithms for shortest paths in planar graphs , 1991, Theor. Comput. Sci..

[2]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[3]  Greg N. Frederickson,et al.  Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications , 1985, SIAM J. Comput..

[4]  Alberto Marchetti-Spaccamela,et al.  Dynamic algorithms for shortest paths in planar graphs , 1993, Theor. Comput. Sci..

[5]  Philip N. Klein,et al.  Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..

[6]  Greg N. Frederickson,et al.  Shortest path problems in planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[7]  Greg N. Frederickson,et al.  Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..

[8]  Gary L. Miller,et al.  Finding Small Simple Cycle Separators for 2-Connected Planar Graphs , 1986, J. Comput. Syst. Sci..

[9]  Giuseppe F. Italiano,et al.  Incremental algorithms for minimal length paths , 1991, SODA '90.

[10]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[11]  Sairam Subramanian.  A Fully Dynamic Data Structure for Reachability in Planar Digraphs , 1993, ESA.

[12]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[13]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[14]  Zvi Galil,et al.  Maintaining Biconnected Components of Dynamic Planar Graphs , 1991, ICALP.

[15]  Shimon Even,et al.  Updating distances in dynamic graphs , 1985 .

[16]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[17]  Philip N. Klein,et al.  A parallel randomized approximation scheme for shortest paths , 1992, STOC '92.

[18]  Grammati E. Pantziou,et al.  Computing Shortest Paths and Distances in Planar Graphs , 1991, ICALP.

[19]  Philip N. Klein,et al.  A linear-processor polylog-time algorithm for shortest paths in planar graphs , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.