1. S. Arora, G. Karakostas, A 2+ ε approximation algorithm for the k-mst problem, in: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, 2000, pp. 754–759.
2. Prize-collecting traveling salesman and related problems;Ausiello;Handbook of Approximation Algorithms and Metaheuristics,2007
3. The prize collecting traveling salesman problem;Balas;Networks,1989
4. Approximation algorithms for orienteering and discounted-reward tsp;Blum;SIAM Journal on Computing,2007
5. A. Blum, R. Ravi, S. Vempala, A constant-factor approximation algorithm for the k mst problem, in: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, ACM, 1996, pp. 442–448.