Abstract
Given a graph G, a subgraph G′ is a t-spanner of G, if for every u, v ∈ V, the distance from u to v in G′ is at most t times longer than the distance in G. In this paper we give a very simple algorithm for constructing sparse spanners for arbitrary weighted graphs. We then apply this algorithm to obtain specific results for planar graphs and Euclidean graphs. We discuss the optimality of our results and present several nearly matching lower bounds.
The work of the second and fourth authors was supported by NSF PYI grant DCR-8402375. The work of the third author was supported by NSF grant CCR-8700917.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Althöfer: On Optimal Realizations of Finite Metric Spaces by Graphs: Discrete and Computational Geometry 3, 1988, 103–122.
Awerbuch: Complexity of Network Synchronization: JACM, 1985, 804–823.
Awerbuch, Bar-Noy, Linial, Peleg: Compact Distributed Data Structures for Adaptive Routing: STOC, 1989, 479–489.
Althöfer, Das, Dobkin, Joseph: Generating Sparse Spanners for Weighted Graphs: submitted to Discrete and Computational Geometry.
Awerbuch, Peleg: Routing with Polynomial Communication-Space Tradeoff: Manuscript, 1989.
Bollobas: Extremal Graph Theory: Academic Press, 1978.
Bandelt, Dress: Reconstructing the Shape of a Tree from Observed Dissimilarity Data: Advances in Appl. Maths, 7, 1986, 309–343.
Bern: private communication to David Dobkin, 1989.
Chew: There is a Planar Graph Almost as Good as the Complete Graph: ACM Symposium on Computational Geometry, 1986, 169–177.
Conway, Sloane: Sphere Packing, Lattices, and Groups: Springer, New York, 1988.
Dress: Trees, Tight Extensions of Metric Spaces: Adv. in Math. 53, 1984, 321–402.
Dobkin, Friedman, Supowit: Delaunay Graphs are Almost as Good as Complete Graphs: FOCS, 1987, 20–26.
Das, Joseph: Which Triangulations Approximate the Complete Graph?: International Symposium on Optimal Algorithms, 1989 (LNCS, Springer-Verlag).
Keil: Approximating the Complete Euclidean Graph: SWAT, 1988 (LNCS, Springer-Verlag).
Keil, Gutwin: The Delaunay Triangulation Closely Approximates the Complete Euclidean Graph: WADS, 1989 (LNCS, Springer-Verlag).
Longyear: Regular d-valent Graphs of Girth 6 and 2(d*d−d+1) Vertices: Journal of Combin. Theory 9, 1970, 420–422.
Levcopoulos, Lingas: There are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees: International Symposium on Optimal Algorithms, 1989 (LNCS, Springer-Verlag).
Peleg, Schäffer: Graph Spanners: Journal of Graph Theory, Vol 13 No 1, 1989, 99–116.
Peleg, Upfal: A Tradeoff Between Space and Efficiency for Routing Tables: STOC, 1988, 43–52.
Peleg, Ullman: An Optimal Synchronizer for the Hypercube: SIAM Journal of Computing, Aug 1989, 740–747.
Simoes-Pereira: A Note on the Tree Realizability of a Distance Matrix: Journal of Combin. Theory 6, 1969, 303–310.
Sedgewick, Vitter: Shortest Paths in Euclidean Graphs: Algorithmica 1, 1986, 31–48.
Tarjan: Data Structures and Network Algorithms: Society for Industrial and Applied Mathematics, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Althöfer, I., Das, G., Dobkin, D., Joseph, D. (1990). Generating sparse spanners for weighted graphs. In: Gilbert, J.R., Karlsson, R. (eds) SWAT 90. SWAT 1990. Lecture Notes in Computer Science, vol 447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52846-6_75
Download citation
DOI: https://doi.org/10.1007/3-540-52846-6_75
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52846-3
Online ISBN: 978-3-540-47164-6
eBook Packages: Springer Book Archive