Abstract
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<ε≤1, our algorithm maintains approximate allpairs shortest-paths in an undirected planar graph G with nonnegative edge lengths. The approximate paths are guaranteed to be accurate to within a (1+ε)-factor. The time bounds for both query and update for our algorithm wis O(ε −1 n 2/3 log2 n log D), where n is the number of nodes in G and D is the sum of its edge lengths.
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.
Research supported by NSF grant CCR-9012357 and NSF PYI award CCR-9157620, together with PYI matching funds from Thinking Machines Corporation and Xerox Corporation. Additional support provided by DARPA contract N00014-91-J-4052 ARPA Order 8225.
Research supported in part by a National Science Foundation Presidential Young Investigator Award CCR-9047466 with matching funds from IBM, by NSF research grant CCR-9007851, by Army Research Office grant DAAL03-91-G-0035, and by the Office of Naval Research and the Defense Advanced Research Projects Agency under contract N00014-91-J-4052 and ARPA order 8225.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
G. Ausiello, G.F. Italiano, A. Marchetti-Spaccamela, and U. Nanni, “Incremental Algorithms for Minimal Length Paths,” Proc. ACM-SIAM Symp. on Discrete Algorithms (1990), 12–21.
E. W. Dijkstra, “A Note on Two Problems in Connexion with Graphs,” Numerische Mathematik 1 (1959), 269–271.
H. N. Djidev, G. E. Pantziou, and C. D. Zaroliagis, “Computing Shortest Paths and Distances in Planar Graphs,” Proc. 18th International Colloquium on Automata, Languages and Programming (1991), 327–338.
S. Even and H. Gazit, “Updating Distances in Dynamic Graphs,” Methods of Operations Research 49 (1985), 371–387.
G.N. Frederickson, “Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications,” SIAM J. Computing 14 (1985), 781–798.
G.N. Frederickson, “Fast Algorithms for Shortest Paths in Planar Graphs, with Applications,” SIAM Journal on Computing 16 (1987), 1004–1022.
M.L. Fredman and R.E. Tarjan, “Fibonacci Heaps and their Uses in Improved Network Optimization Algorithms,” Journal of the Association for Computing Machinery 34 (1987), 596–615.
E. Fuerstein and A. Marchetti-Spaccamela, “Dynamic Algorithms for shortest Path Problems in Planar Graphs,” Proc. 17th International Workshop on Graph Theoretic Concepts in Computer Science (1991), 187–197.
Z. Galil and G. F. Italiano, “Maintaining biconnected components of dynamic planar graphs,” Proc. 18th Int. Colloquium or Automata, Languages, and Programming. (1991), 339–350.
Z. Galil, G.F. Italiano, and N. Sarnak, “Fully Dynamic Planarity Testing,” Proc. 24th Annual ACM Symposium on Theory of Computing (1992), 495–506.
P. N. Klein and S. Sairam, “A Parallel Randomized Approximation Scheme for Shortest Paths,” Proc. 24th ACM Symp. on Theory of Computing (1992), 750–758.
R.J. Lipton and R.E. Tarjan, “A Separator Theorem for Planar Graphs,” SIAM Journal of Applied Mathematics 36(1979), 177–189.
G. Miller, “Finding Small Simple Cycle Separators for 2-Connected Planar Graphs,” Journal of Computer and System Sciences 32 (1986), 265–279.
Sairam Subramanian, “Parallel and Dynamic Graph Algorithms: A Combined Perspective,” Department of Computer Science, Brown University, Ph.D. Thesis, 1993.
Sairam Subramanian, “A Fully Dynamic Data Structure For Reachability in Planar Digraphs,” Department of Computer Science, Brown University, Technical report, 1993, submitted to the European Symposium on Algorithms.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klein, P.N., Subramanian, S. (1993). A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs. In: Dehne, F., Sack, JR., Santoro, N., Whitesides, S. (eds) Algorithms and Data Structures. WADS 1993. Lecture Notes in Computer Science, vol 709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57155-8_269
Download citation
DOI: https://doi.org/10.1007/3-540-57155-8_269
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57155-1
Online ISBN: 978-3-540-47918-5
eBook Packages: Springer Book Archive