Faster geometric k-point MST approximation

Computational Geometry: Theory and Applications

Volumn 8, Issue 5, 1997, Pages 231-240

  Eppstein, David ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Approximation; Clustering; Geometric network design; Minimum spanning tree; Quadtree

Indexed keywords

EID: 0038913616     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(96)00021-1     Document Type: Article

References (16)

1. S. Arora, Polynomial time approximation schemes for Euclidean TSP and other geometric problems, in: Proc. 37th IEEE Sympos. Found. Comput. Sci. (1996) 2-11.
2. B. Awerbuch, Y. Azar, A. Blum and S. Vempala, Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen, in: Proc. 27th ACM Sympos. Theory Comput. (1995) 277-283.
3. M. Bern, D. Eppstein and S.-H. Teng, Parallel construction of quadtrees and quality triangulations, in: Proc. 3rd Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 709 (Springer, Berlin, 1993) 188-199.
4. A. Blum, P. Chalasani and S. Vempala, A constant-factor approximation for the k-MST problem in the plane, in: Proc. 27th ACM Sympos. Theory Comput. (1995) 294-302.
5. A. Blum, R. Ravi and S. Vempala, A constant-factor approximation algorithm for the k-MST problem, in: Proc. 28th ACM Sympos. Theory Comput. (1996) 442-448.
6. S.Y. Cheung and A. Kumar, Efficient quorumcast routing algorithms, in: Proc. IEEE INFOCOM '94 Conf. Comput. Communications, Vol. 2 (1994) 840-847.
7. A. Datta, H.-P. Lenhof, C. Schwarz and M. Smid, Static and dynamic algorithms for k-point clustering problems, in: Proc. 3rd Workshop Algorithms and Data Structures, Lecture Notes in Computer Science 709 (Springer, Berlin, 1993) 265-276.
8. D. Eppstein and J. Erickson, Iterated nearest neighbors and finding minimal polytopes, Discrete Comput. Geom. 11 (1994) 321-350.
9. N. Garg and D.S. Hochbaum, An O(log k) approximation for the k minimum spanning tree problem in the plane, in: Proc. 26th ACM Sympos. Theory Comput. (1994) 432-438.
10. E.N. Gilbert and H.O. Pollak, Steiner minimal trees, SIAM J. Appl. Math. 16 (1968) 1-29.
11. C.S. Mata and J.S.B. Mitchell, Approximation algorithms for geometric tour and network design problems, in: Proc. 11th ACM Sympos. Comput. Geom. (1995) 360-369.
12. J.S.B. Mitchell, Guillotine subdivisions approximate polygonal subdivisions: a simple new method for the geometric k-MST problem, in: Proc. 7th ACM-SIAM Sympos. Discrete Algorithms (1996) 402-408.
13. R. Ravi, R. Sundaram, M.V. Marathe, D.J. Rosenkrantz and S.S. Ravi, Spanning trees short and small, in: Proc. 5th ACM-SIAM Sympos. Discrete Algorithms (1994) 546-555.
14. H. Samet, The Design and Analysis of Spatial Data Structures (Addison-Wesley, Reading, MA, 1990).
15. W.D. Smith, Studies in computational geometry motivated by mesh generation, Ph.D. Thesis. Princeton University (1988).
16. A.A. Zelikovsky and D.D. Lozevanu, Minimal and bounded trees, in: Tezele Cong. XVIII Acad. Romano-Americane, Kishinev (1993) 25-26.