Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation
暂无分享,去创建一个
[1] Santosh S. Vempala,et al. A Constant-Factor Approximation Algorithm for the k-MST Problem , 1999, J. Comput. Syst. Sci..
[2] Sanjeev Arora,et al. Approximation schemes for minimum latency problems , 1999, STOC '99.
[3] Matteo Fischetti,et al. Weighted k-cardinality trees: Complexity and polyhedral structure , 1994, Networks.
[4] Santosh S. Vempala,et al. New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen , 1999, SIAM J. Comput..
[5] Sanjeev Arora,et al. A 2 + ɛ approximation algorithm for the k-MST problem , 2000, SODA '00.
[6] David P. Williamson,et al. A general approximation technique for constrained forest problems , 1992, SODA '92.
[7] R. Ravi,et al. Spanning trees short or small , 1994, SODA '94.
[8] Sanjeev Arora,et al. A 2+epsilon approximation algorithm for the k-MST problem , 2000, SODA.
[9] Marshall W. Bern,et al. The Steiner Problem with Edge Lengths 1 and 2 , 1989, Inf. Process. Lett..
[10] David P. Williamson,et al. Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.
[11] Sudipto Guha,et al. Improved combinatorial algorithms for the facility location and k-median problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[12] Vijay V. Vazirani,et al. Primal-dual approximation algorithms for metric facility location and k-median problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[13] Amin Saberi,et al. A new greedy approach for facility location problems , 2002, STOC '02.
[14] Sunil Arya,et al. A 2.5-Factor Approximation Algorithm for the k-MST Problem , 1998, Inf. Process. Lett..
[15] Madhu Sudan,et al. The minimum latency problem , 1994, STOC '94.
[16] Santosh S. Vempala,et al. Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen , 1995, STOC '95.
[17] Jon M. Kleinberg,et al. An improved approximation ratio for the minimum latency problem , 1996, SODA '96.
[18] Naveen Garg,et al. A 3-approximation for the minimum tree spanning k vertices , 1996, Proceedings of 37th Conference on Foundations of Computer Science.