Fast greedy algorithms for constructing sparse geometric spanners

SIAM Journal on Computing

Volumn 31, Issue 5, 2002, Pages 1479-1500

  Gudmundsson, Joachim ^a   Levcopoulos, Christos ^a   Narasimhan, Giri ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Computational geometry; Custer graph; Sparse geometric spanners

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; GRAPH THEORY; TRAVELING SALESMAN PROBLEM;

CLUSTER GRAPHS;

SET THEORY;

EID: 0036588760     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539700382947     Document Type: Article

References (17)

1. I. Althöfer, G. Das, D.P. Dobkin, P. Joseph, and J. Soares, On sparse spanners of weighted graphs, Discrete Comput. Geom., 9 (1993), pp. 81-100.
2. S. Arya, G. Das, D.M. Mount, J.S. Salowe, and M. Smid, Euclidean spanners: Short, thin, and lanky, in Proceedings of the 27th Annual ACM Symposium on Theory of Computing, ACM, New York, 1995, pp. 489-498.
3. 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. ACM, 42 (1995), pp. 67-90.
4. B. Chandra, G. Das, G. Narasimhan, and J. Soares, New sparseness results on graph spanners, Internat. J, Comput. Geom. Appl., 5 (1995), pp. 124-144.
5. D.Z. Chen, G. Das, and M. Smid, Lower bounds for computing geometric spanners and approximate shortest paths, in Proceedings of the 8th Annual Canadian Conference on Computational Geometry, Ottawa, Canada, 1996, pp. 155-160.
6. A. Czumaj and A. Lingas, Linear-time heuristics for minimum weight rectangulation, in Proceedings of the 27th Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci. 1853, Springer-Verlag, New York, 2000, pp. 856-868.
7. G. Das, P. Heffernan, and G. Narasimhan, Optimally sparse spanners in 3-dimensional Euclidean space, in Proceedings of the 9th Annual ACM Symposium on Computational Geometry, ACM, New York, 1993, pp. 53-62.
8. G. Das and G. Narasimhan, A fast algorithm for constructing sparse Euclidean spanners, Internat. J. Comput. Geom. Appl., 7 (1997), pp. 297-315.
9. J.M. Keil and C.A. Gutwin, Classes of graphs which approximate the complete Euclidean graph, Discrete Comput. Geom., 7 (1992), pp. 13-28.
10. 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 (1992), pp. 251-256.
11. C. Levcopoulos, G. Narasimhan, and M. Smid, Efficient algorithms for constructing fault-tolerant geometric spanners, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, ACM, New York, 1998, pp. 186-195.
12. D. Mount, Private communication, Department of Computer Science, University of Maryland, College Park, MD, 1998.
13. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
14. S.B. Rao and W.D. Smith, Improved approximation schemes for traveling salesman tours, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, ACM, New York, 1998, pp. 540-550.
15. J.S. Salowe, Construction of multidimensional spanner graphs with applications to minimum spanning trees, in Proceedings of the 7th Annual ACM Symposium on Computational Geometry, ACM, New York, 1991, pp. 256-261.
16. M. Thorup, Undirected single-source shortest path with positive integer weights in linear time, J. ACM, 46 (1999), pp. 362-394.
17. P.M. Vaidya, A sparse graph almost as good as the complete graph on points in K dimensions, Discrete Comput. Geom., 6 (1991), pp. 369-381.