A fast algorithm for constructing sparse euclidean spanners

International Journal of Computational Geometry and Applications

Volumn 7, Issue 4, 1997, Pages 297-315

  Das, Gautam ^a   Narasimhan, Giri ^a  

^a University of Memphis   (United States)

Author keywords

Algorithm; Clustering; Euclidean; Spanners; Sparse spanners

Indexed keywords

EID: 0031496743     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195997000193     Document Type: Article

References (12)

1. I. Althöfer, G. Das, D. P. Dobkin, D. Joseph and J. Soares, "On Sparse Spanners of Weighted Graphs," Discrete and Computational Geometry, 9 (1993) 81-100.
2. S. Arya, G. Das, D. Mount, J. Salowe, M. Smid, "Euclidean Spanners, Short, Thin and Lanky", Proc. 27th Annual ACM Symp. on Theory of Comput., (1995) 489-498.
3. B. Awerbuch, D. Peleg, "Sparse Partitions", Proceedings of the 31st IEEE Foundations of Computer Science, (1991).
4. E. Cohen, "Fast Algorithms for Constructing t-Spanners and Paths with Stretch t", Proceedings of the 33rd IEEE Foundations of Computer Science, (1993).
5. B. Chandra, G. Das, G. Narasimhan, J. Soares, "New Sparseness Results on Graph Spanners", International Journal of Computational Geometry and Applications, 5(1-2) (1995) 125-144.
6. G. Das, P. Heffernan, G. Narasimhan, "Optimally Sparse Spanners in 3-Dimensional Euclidean Space", Proceedings of the 9th Annual ACM Symposium on Computational Geometry, (1993), 53-62.
7. G. Das, P. Heffernan, "Constructing Degree-3 Spanners with Other Sparseness Properties", Proceedings of the 4th International Symposium on Algorithms and Computations, (1993).
8. G. Das, G. Narasimhan, J.S. Salowe, "A New Way to Weigh Malnourished Euclidean Graphs", Proc. 6th SIAM-ACM Symposium on Discrete Algorithms, (1995) 215-222.
9. C. Levcopoulos, A. Lingas, "There are Planar Graphs Almost as Good as the Complete Graphs and as Short as the Minimum Spanning Trees", Proceedings of the 2nd international Symposium on Optimal Algorithms, LNCS, Springer-Verlag, Vol 401, (1989) 9-13.
10. J.S. Salowe, "Construction of Multidimensional Spanner Graphs with Applications to Minimum Spanning Trees", Proceedings of the 8th Annual ACM Symposium on Computational Geometry, (1991), 256-261.
11. J. Soares, "Graph Spanners", Ph.D Thesis, Univ. of Chicago Technical Report CS 92-14, (1992).
12. P.M. Vaidya, "A Sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions", Discrete and Computational Geometry, 6, (1991) 369-381.