Tree spanners in planar graphs

Discrete Applied Mathematics

Volumn 108, Issue 1-2, 2001, Pages 85-103

  Fekete, Sándor P ^a   Kremer, Jana ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF BAMBERG   (Germany)

Author keywords

Distance in graphs; Graph spanners; Planar graphs

Indexed keywords

EID: 0242542099     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00226-2     Document Type: Article

References (22)

1. Althöfer I., Das G., Dobkin D., Joseph D., Soares J. On sparse spanners of weighted graphs. Discrete Comput. Geom. 9:1993;81-100.
2. Arikati S., Chen D.Z., Chew L.P., Das G., Smid M., Zaroliagis D. Planar spanners and approximate shortest path queries among obstacles in the plane. Diaz J. Algorithms - ESA '96. Springer Lecture Notes in Computer Science. Vol. 1136:1996;514-528 Springer, Berlin.
3. B. Awerbuch, A. Baratz, D. Peleg, Efficient broadcast and light-weight spanners, Manuscript, 1992.
4. Bondy J.A., Murty U.S.R. Graph Theory with Applications. 1976;North-Holland, New York.
5. U. Brandes, D. Handke, NP-completeness results for minimum planar spanners, Proceedings of the 23th Workshop on Graph-Theoretic Concepts in Computer Science (WG '97), Springer Lecture Notes in Computer Science, Vol. 1335, 1997, pp. 85-99.
6. L. Cai, Tree spanners: spanning trees that approximate distances, Ph.D. Thesis, University of Toronto, Toronto, Canada, 1992. Available as Technical Report 260 / 92, Department of Computer Science, University of Toronto.
7. Cai L. NP-completeness of minimum spanner problems. Discrete Appl. Math. 48:1994;187-194.
8. Cai L., Corneil D.G. Tree spanners. SIAM J. Discrete Math. 8:1995;359-387.
9. L.P. Chew, There is a planar graph almost as good as the complete graph, Proceedings of the Second ACM Symposium on Computational Geometry, SoCG, 1986, pp. 169-177.
10. Cook W.J., Cunningham W.H., Pulleyblank W.R., Schrijver A. Combinatorial Optimization. 1998;Wiley Interscience, New York.
11. Dobkin D.P., Friedman S.J., Supowit K.J. Delaunay graphs are almost as good as complete graphs. Discrete Comput. Geom. 5:1990;399-407.
12. Y. Dodis, S. Khanna, Designing networks with bounded pairwise distance, Proceedings of the 30th ACM Symposium on the Theory of Computing, STOC, 1999, pp. 750-759.
13. S.P. Fekete, J. Kremer, Tree spanners in planar graphs, Proceedings of the 24th International Annual Workshop on Graph-Theoretic Concepts in Computer Science, WG 98, 1998.
14. G. Kortsarz, On the hardness of approximating spanners, Approximation Algorithms for Combinatorial Optimization (APPROX 98), Springer Lecture Notes in Computer Science, Vol. 1444, Springer, Berlin, 1998, pp. 135-146.
15. G. Kortsarz, D. Peleg, Generating sparse 2-spanners, Proceedings of the Third Scandinavian Workshop on Algorithm Theory, SWAT, 1992.
16. J. Kremer, Baumspanner in planaren Graphen, Diploma Thesis, Mathematisches Institut, Universität zu Köln, 1997.
17. Lichtenstein D. Planar formulae and their uses. SIAM J. Comput. 11:1982;329-343.
18. Liestman A.L., Shermer T. Grid spanners. Networks. 23:1993;123-133.
19. Peleg D., Schäffer A.A. Graph spanners. J. Graph Theory. 13:1989;99-116.
20. D. Peleg, J.D. Ullman, An optimal synchronizer for the hypercube, Proceedings of the Sixth ACM Symposium on Principles of Distributed Computing, 1987, pp. 77-85.
21. Richards D., Liestman A.L. Degree-constrained pyramid spanners. Parallel Distributed Comput. 25:1995;1-6.
22. Soares J. Graph spanners: a survey. Congr. Numer. 89:1992;225-238.