Fault-tolerant geometric spanners

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2003, Pages 1-10

  Czumaj, Artur ^a   Zhao, Hairong ^a  

^a University Heights   (United States)

Author keywords

Computational Geometry; Fault tolerant spanners; Greedy algorithms; Spanners

Indexed keywords

ALGORITHMS; GRAPH THEORY; OPTIMIZATION; THEOREM PROVING; TREES (MATHEMATICS);

SPANNERS;

COMPUTATIONAL GEOMETRY;

EID: 0038714891     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777792.777794     Document Type: Conference Paper

References (24)

1. I. Althöfer, G. Das, D. Dobkin, D. Joseph, and J. Soares. On sparse spanners of weighted graphs. Discrete & Computational Geometry, 9:81-100, 1993.
2. S. Arya, G. Das, D. M. Mount, J. S. Salowe, and M. Smid. Euclidean spanners: Short, thin, and lanky. Proc. 27th Annual ACM Symposium on Theory of Computing (STOC), pp. 489-498, 1995.
3. S. Arya, D. M. Mount, and M. Smid. Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. Discrete & Computational Geometry, 13(2):91-107, 1999.
4. S. Arya and M. Smid. Efficient construction of a bounded-degree spanner with low weight. Algorithmica, 17(1):33-54, 1997.
5. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry. Springer, Berlin, 1997.
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. Journal of the ACM, 42(1):67-90, 1995.
7. B. Chandra, G. Das, G. Narasimhan, and J. Soares. New sparseness results on graph spanners. Proc. 8th Annual ACM Symposium on Computational Geometry (SoCG), pp. 192-201, 1992.
8. P. L. Chew. There is a planar graph as good as the complete graph. Proc. 2nd Annual ACM Symposium on Computational Geometry (SoCG), pp. 169-177, 1986.
9. B. Chazelle. A functional approach to data structures and its use in multidimensional seaching. SIAM Journal on Computing, 17:427-462, 1988.
10. A. Czumaj and A. Lingas. Fast approximation schemes for Euclidean multi-connectivity problems. Proc. 27th Annual International Colloquium on Automata, Languages and Programming (ICALP), pp. 856-868, 2000.
11. G. Das, P. Heffernan, and G. Narasimhan. Optimally sparse spanners in 3-dimensional Euclidean space. Proc. 9th Annual ACM Symposium on Computational Geometry (SoCG), pp. 53-62, 1993.
12. G. Das and G. Narasimhan. A fast algorithm for constructing sparse Euclidean spanners. International Journal of Computational Geometry and Applications, 7(4):293-315, 1997.
13. G. Das, G. Narasimhan, and J. Salowe. A new way to weigh malnourished Euclidean graphs. Proc. 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 215-222, 1995.
14. D. Eppstein. Spanning trees and spanners. In Handbook of Computational Geometry, pp. 425-461, 1997.
15. J. Gudmundsson, C. Levcopoulos, and G. Narasimhan. Fast greedy algorithms for constructing sparse geometric spanners. SIAM Journal on Computing, 31(5):1479-1500, 2002.
16. 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.
17. C. Levcopoulos, G. Narasimhan, and M. H. M. Smid. Improved algorithms for constructing fault-tolerant spanners. Proc. 30th Annual ACM Symposium on Theory of Computing (STOC), pp. 186-195, 1998.
18. T. Lukovszki. New results on fault tolerant geometric spanners. Proc. 6th Workshop on Algorithms and Data Structures (WADS), pp. 193-204, 1999.
19. K. Mehlhorn and S. Näher. Dynamic fractional cascading. Algorithmica, 5:215-241, 1990.
20. D. Peleg. Distributed Computing: A Locality-sensitive Approach. SIAM, Philadelphia, PA, 2000.
21. D. Peleg and A. Schäffer. Graph spanners. Journal of Graph Theory, 13:99-116, 1989.
22. S. B. Rao and W. D. Smith. Approximating geometrical graphs via "spanners" and "banyans." Proc. 30th Annual ACM Symposium on Theory of Computing (STOC), pp. 540-550, 1998.
23. J. Ruppert and R. Seidel. Approximating the d-dimensional complete Euclidean graph. Proc. 3rd Canadian Conference on Computational Geometry (CCCG), pp. 207-210, 1991.
24. A. C. Yao. On Constructing minimum spanning trees in k-demensional spaces and related problems. SIAM Journal on Computing, 11:721-736, 1982.