Improved algorithms for constructing fault-tolerant spanners

Algorithmica (New York)

Volumn 32, Issue 1, 2002, Pages 144-156

  Levcopoulos, C ^a   Narasimhan, G ^b   Smid, M ^c  

^a LUND UNIVERSITY   (Sweden)

^b University of Memphis   (United States)

^c OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Computational geometry; Fault tolerance; Spanners; Well separated pairs

Indexed keywords

EID: 0038722247     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0075-x     Document Type: Article

References (18)

1. I. Althöfer, G. Das, D. P. Dobkin, D. Joseph, and J. Scares. On sparse spanners of weighted graphs. Discrete Comput. Geom., 9:81-100, 1993.
2. S. Arya, G. Das, D. M. Mount, J. S. Salowe, and M. Smid. Euclidean spanners: short, thin, and lanky. In Proc. 27th Annu. ACM Sympos. Theory Comput., pages 489-498, 1995.
3. M. Ben-Or. Lower bounds for algebraic computation trees. In Proc. 15th Annu. ACM Sympos. Theory Comput., pages 80-86, 1983.
4. P. B. Callahan. Dealing with higher dimensions: the well-separated pair decomposition and its applications. Ph.D. thesis, Dept. Computer Science, Johns Hopkins University, Baltimore, Maryland, 1995.
5. P. B. Callahan and S. R. Kosaraju. Faster algorithms for some geometric graph problems in higher dimensions. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, pages 291-300, 1993.
6. P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. Assoc. Comput. Mach., 42:67-90, 1995.
7. B. Chandra, G. Das, G. Narasimhan, and J. Soares. New sparseness results on graph spanners. Internat. J. Comput. Geom. Appl., 5:125-144, 1995.
8. D. Z. Chen, G. Das, and M. Smid. Lower bounds for computing geometric spanners and approximate shortest paths. In Proc. 8th Canad. Conf. Comput. Geom., pages 155-160, 1996.
9. G. Das and G. Narasimhan. A fast algorithm for constructing sparse Euclidean spanners. Internat. J. Comput. Geom. Appl., 7:297-315, 1997.
10. 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.
11. J. Gudmundsson, C. Levcopoulos, and G. Narasimhan. Improved greedy algorithms for constructing sparse geometric spanners. In Proc. 7th Scandinavian Workshop Algorithm Theory, pages 314-327. Volume 1851 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2000.
12. J. M. Keil and C. A. Gutwin. Classes of graphs which approximate the complete Euclidean graph. Discrete Comput. Geom., 7:13-28, 1992.
13. C. Levcopoulos, G. Narasimhan, and M. Smid. Efficient algorithms for constructing fault-tolerant geometric spanners. Proc. 30th Annu. ACM Sympos. Theory Comput., pages 186-195, 1998.
14. T. Lukovszki. New results on fault tolerant geometric spanners. In Proc. 6th Workshop Algorithms Data Structures, pages 193-204. Volume 1663 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1999.
15. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, Berlin, 1988.
16. J. S. Salowe. Constructing multidimensional spanner graphs. Internat. J. Comput. Geom. Appl., 1:99-107, 1991.
17. S. Ueno, M. Yamazaki, and Y. Kajitani. Graph spanners and connectivity. In Proc. 3rd Annu. Internat. Sympos. Algorithms Comput. Volume 650 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1992.
18. P. M. Vaidya. A sparse graph almost as good as the complete graph on points in K dimensions. Discrete Comput. Geom., 6:369-381, 1991.