论文信息 - AnO(logk)-approximation algorithm for thek minimum spanning tree problem in the plane

AnO(logk)-approximation algorithm for thek minimum spanning tree problem in the plane

Givenn points in the Euclidean plane, we consider the problem of finding the minimum tree spanning anyk points. The problem isNP-hard and we give anO(logk)-approximation algorithm.

Dorit S. Hochbaum | Naveen Garg

[1] Santosh S. Vempala,et al. Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen , 1995, STOC '95.

[2] Santosh S. Vempala,et al. A constant-factor approximation for the k-MST problem in the plane , 1995, STOC '95.

[3] S. S. Ravi,et al. Facility Dispersion Problems: Heuristics and Special Cases (Extended Abstract) , 1991, WADS.

[4] M. Fischetti,et al. Weighted k-cardinality trees , 1992 .

[5] Dorit S. Hochbaum,et al. k-edge Subgraph Problems , 1997, Discret. Appl. Math..

[6] David Eppstein. Faster Geometric K-point MST Approximation , 1997, Comput. Geom..

[7] Guy Kortsarz,et al. On choosing a dense subgraph , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[8] R. Ravi,et al. Spanning trees short or small , 1994, SODA '94.

[9] Matteo Fischetti,et al. Weighted k-cardinality trees: Complexity and polyhedral structure , 1994, Networks.

[10] Madhav V. Marathe,et al. Compact Location Problems , 1993, Theor. Comput. Sci..

[11] Alok Aggarwal,et al. Finding k Points with Minimum Diameter and Related Problems , 1991, J. Algorithms.

[12] Joseph S. B. Mitchell,et al. Guillotine subdivisions approximate polygonal subdivisions: a simple new method for the geometric k-MST problem , 1996, SODA '96.