A Constant-Factor Approximation Algorithm for the k-MST Problem
暂无分享,去创建一个
[1] Matteo Fischetti,et al. Weighted k-cardinality trees: Complexity and polyhedral structure , 1994, Networks.
[2] Joseph S. B. Mitchell,et al. Guillotine subdivisions approximate polygonal subdivisions: a simple new method for the geometric k-MST problem , 1996, SODA '96.
[3] Santosh S. Vempala,et al. A constant-factor approximation for the k-MST problem in the plane , 1995, STOC '95.
[4] Dorit S. Hochbaum,et al. An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane , 1994, STOC '94.
[5] David P. Williamson,et al. A general approximation technique for constrained forest problems , 1992, SODA '92.
[6] R. Vohra,et al. The Orienteering Problem , 1987 .
[7] 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.
[8] Egon Balas,et al. The prize collecting traveling salesman problem , 1989, Networks.
[9] Santosh S. Vempala,et al. Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen , 1995, STOC '95.
[10] Madhu Sudan,et al. The minimum latency problem , 1994, STOC '94.
[11] R. Ravi,et al. Spanning trees short or small , 1994, SODA '94.
[12] Jon M. Kleinberg,et al. An improved approximation ratio for the minimum latency problem , 1996, SODA '96.