A 2 + ɛ approximation algorithm for the k-MST problem
暂无分享,去创建一个
[1] Joseph S. B. Mitchell,et al. Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems , 1999, SIAM J. Comput..
[2] Naveen Garg,et al. A 3-approximation for the minimum tree spanning k vertices , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[3] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[4] Santosh S. Vempala,et al. A constant-factor approximation for the k-MST problem in the plane , 1995, STOC '95.
[5] Santosh S. Vempala,et al. Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen , 1995, STOC '95.
[6] Jon M. Kleinberg,et al. An improved approximation ratio for the minimum latency problem , 1996, SODA '96.
[7] R. Ravi,et al. When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks , 1995, SIAM J. Comput..
[8] Sanjeev Arora,et al. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.
[9] R. Ravi,et al. Spanning trees short or small , 1994, SODA '94.
[10] Madhu Sudan,et al. The minimum latency problem , 1994, STOC '94.
[11] Santosh S. Vempala,et al. New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen , 1999, SIAM J. Comput..
[12] Sunil Arya,et al. A 2.5-Factor Approximation Algorithm for the k-MST Problem , 1998, Inf. Process. Lett..
[13] Santosh S. Vempala,et al. A Constant-Factor Approximation Algorithm for the k-MST Problem , 1999, J. Comput. Syst. Sci..
[14] David P. Williamson,et al. A general approximation technique for constrained forest problems , 1992, SODA '92.
[15] Matteo Fischetti,et al. Weighted k-cardinality trees: Complexity and polyhedral structure , 1994, Networks.
[16] Sanjeev Arora,et al. Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.