Efficient Construction of a Bounded-Degree Spanner with Low Weight

Algorithmica (New York)

Volumn 17, Issue 1, 1997, Pages 33-54

  Arya, S ^a   Smid, M ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Computational geometry; Distance enumeration; Greedy algorithm; Spanners

Indexed keywords

EID: 0007474505     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02523237     Document Type: Article

References (20)

1. S. Arya, G. Das, D. M. Mount, J. S. Salowe, and M. Smid. Euclidean spanners: short, thin, and lanky. Proc. 27th Annual ACM Symp. on the Theory of Computing, 1995, pp. 489-498.
2. B. Chandra, G. Das, G. Narasimhan, and J. Soares. New sparseness results on graph spanners. Proc. 8th Annual ACM Symp. on Computational Geometry, 1992, pp. 192-201.
3. G. Das and P. J. Heffernan. Constructing degree-3 spanners with other sparseness properties. Proc. 4th Annual Internat. Symp. on Algorithms, 1993, pp. 11-20. Lecture Notes in Computer Science, Vol. 762, Springer-Verlag, Berlin.
4. G. Das and P. J. Heffernan. Constructing degree-3 spanners with other sparseness properties. Proc. 4th Annual Internat. Symp. on Algorithms, 1993, pp. 11-20. Lecture Notes in Computer Science, Vol. 762, Springer-Verlag, Berlin.
5. G. Das, P. Heffernan, and G. Narasimhan. Optimally sparse spanners in three-dimensional Euclidean space. Proc. 9th Annual ACM Symp. on Computational Geometry, 1993, pp. 53-62.
6. G. Das and G. Narasimhan. A fast algorithm for constructing sparse Euclidean spanners. Proc. 10th Annual ACM Symp. on Computational Geometry, 1994, pp. 132-139.
7. G. Das, G. Narasimhan, and J. Salowe. A new way to weigh malnourished Euclidean graphs. Proc. 6th Annual ACM-SIAM Symp. on Discrete Algorithms, 1995, pp. 215-222.
8. A. Datta, H. P. Lenhof, C. Schwarz, and M. Smid. Static and dynamic algorithms for k-point clustering problems. Proc. 3rd WADS, 1993, pp. 265-276. Lecture Notes in Computer Science, Vol. 709, Springer- Verlag, Berlin.
9. A. Datta, H. P. Lenhof, C. Schwarz, and M. Smid. Static and dynamic algorithms for k-point clustering problems. Proc. 3rd WADS, 1993, pp. 265-276. Lecture Notes in Computer Science, Vol. 709, Springer-Verlag, Berlin.
10. M. T. Dickerson, R. L. Drysdale, and J. R. Sack. Simple algorithms for enumerating interpoint distances and finding k nearest neighbors. Internat. J. Comput. Geom. Appl. 2 (1992), 221-239.
11. H.-P. Lenhof and M. Smid. Enumerating the k closest pairs optimally. Proc. 33rd Annual IEEE Symp. on Foundations of Computer Science, 1992, pp. 380-386.
12. K. Mehlhorn and S. Näher. Dynamic fractional cascading. Algorithmica 5 (1990), 215-241.
13. F. P. Preparata and M. I. Shamos. Computational Geometry, an Introduction. Springer-Verlag, New York, 1985.
14. J. S. Salowe. Constructing multidimensional spanner graphs. Internat. J. Comput. Geom. Appl. 1 (1991), 99-107.
15. J. S. Salowe. Enumerating interdistances in space. Internat. J. Comput. Geom. Appl. 2 (1992), 49-59.
16. J. S. Salowe. On Euclidean spanner graphs with small degree. Proc. 8th Annual ACM Symp. on Computational Geometry, 1992, pp. 186-191.
17. J. S. Salowe. Personal communication, 1994.
18. M. Smid. Maintaining the minimal distance of a point set in polylogarithmic time. Discrete Comput. Geom. 7 (1992), 415-431.
19. P. M. Vaidya. A sparse graph almost as good as the complete graph on points in K dimensions. Discrete Comput. Geom. 6 (1991), 369-381.
20. A. C. Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput. 11 (1982), 721-736.