Author:
Han Lu,Wang Changjun,Xu Dachuan,Zhang Dongmei
Publisher
Springer International Publishing
Reference18 articles.
1. Archer, A., Bateni, M.H., Hajiaghayi, M.T., Karloff, H.: Improved approximation algorithms for prize-collecting Steiner tree and TSP. SIAM J. Comput. 40, 309–332 (2011)
2. Arora, S., Karakostas, G.: A $$2+\varepsilon $$ approximation algorithm for the $$k$$-MST problem. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 754–759 (2000)
3. Arya, S., Ramesh, H.A.: $$2.5$$-factor approximation algorithm for the $$k$$-MST problem. Inf. Process. Lett. 65, 117–118 (1998)
4. Awerbuch, B., Azar, Y., Blum, A., Vempala, S.: Improved approximation guarantees for minimum-weight $$k$$-trees and prize-collecting salesmen. SIAM J. Comput. 28, 254–262 (1999)
5. Bienstock, D., Goemans, M.X., Simchi-Levi, D., Williamson, D.P.: A note on the prize collecting traveling salesman problem. Math. Program. 59, 413–420 (1993)