Constructing plane spanners of bounded degree and low weight

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2461, Issue , 2002, Pages 234-246

  Bose, Prosenjit ^a   Gudmundsson, Joachim ^b   Smid, Michiel ^a  

^a CARLETON UNIVERSITY   (Canada)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

A-PLANE; BOUNDED DEGREE; EDGE LENGTH; MINIMUM SPANNING TREES; TIME ALGORITHMS;

TREES (MATHEMATICS);

EID: 84861634941     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_24     Document Type: Conference Paper

References (14)

1. D. Barnette. Trees in polyhedral graphs. Canadian Journal of Mathematics, 18:731-736, 1966. 236
2. P. Bose and P. Morin. Online routing in triangulations. In Proc. 10th Annu. Internat. Sympos. Algorithms Comput., volume 1741 of Lecture Notes Comput. Sci., pages 113-122. Springer-Verlag, 1999. 243
3. G. Das, P. Heffernan, and G. Narasimhan. Optimally sparse spanners in 3- dimensional Euclidean space. In Proc. 9th Annu. A CM Sympos. Comput. Geom., pages 53-62, 1993. 244
4. G. Das and D. Joseph. Which triangulations approximate the complete graph? In Proc. International Symposium on Optimal Algorithms, volume 401 of Lecture Notes Comput. Sci., pages 168-192. Springer-Verlag, 1989. 234
5. G. Das, G. Narasimhan, and J. Salowe. A new way to weigh malnourished Euclidean graphs. In Proc. 6th ACM-SIAM Sympos. Discrete Algorithms, pages 215-222, 1995. 244
6. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany, 2nd edition, 2000. 243
7. H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41-51, 1990. 236
8. D. P. Dobkin, S. J. Friedman, and K. J. Supowit. Delaunay graphs are almost as good as complete graphs. Discrete Comput. Geom., 5:399-407, 1990. 243
9. D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 425-461. Elsevier Science Publishers, Amsterdam, 2000. 234
10. J. Gudmundsson, C. Levcopoulos, and G. Narasimhan. Improved greedy algorithms for constructing sparse geometric sp anners. In Proc. 7th Scand. Workshop Algorithm Theory, volume 1851 of Lecture Notes Comput. Sci., pages 314-327, Berlin, 2000. Springer-Verlag. 234, 235, 243, 244
11. J. M. Keil and C. A. Gutwin. Classes of graphs which approximate the complete Euclidean gr aph. Discrete Comput. Geom., pages 13-28, 1992. 234, 238, 244
12. C. Levcopoulos and A. Lingas. There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees. Algorithmica, 8:251-256, 1992. 234
13. C. Levcopoulos, G. Narasimhan, and M. Smid. Improved algorithms for constructing fault-tolerant spanners. Algorithmica, 32:144-156, 2002. 234
14. M. Smid. Closest point problems in computational geometry. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 877-935. Elsevier Science Publishers, Amsterdam, 2000. 234