Prize-collecting traveling salesman and related problems

Handbook of Approximation Algorithms and Metaheuristics

Volumn , Issue , 2007, Pages 40-1-40-14

  Ausiello, Giorgio ^a   Bonifaci, Vincenzo ^a   Leonardi, Stefano ^a   Marchetti Spaccamela, Alberto ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84455169508     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781420010749     Document Type: Chapter

References (36)

1. Balas, E., The prize collecting traveling salesman problem, Networks, 19, 621, 1989.
2. Arora, S. and Karakostas, G., A 2+ε approximation algorithm for the k-MST problem, Proc. SODA, 2000, p. 754.
3. Arya, S. and Ramesh, H., A 2.5-factor approximation algorithm for the k-MST problem, Inf. Proc. Lett., 65(3), 117, 1998.
4. Blum, A., Ravi, R., and Vempala, S., A constant-factor approximation algorithm for the k-MST problem, Proc. of STOC, 1996, p. 442.
5. Garg, N., A 3-approximation for the minimum tree spanning k vertices, Proc. FOCS, 1996, p. 302.
6. Garg, N., Saving an epsilon: A 2-approximation for the k-MST problem in graphs, Proc. STOC, 2005, p. 396.
7. Goemans, M. and Williamson, D. P., A general approximation technique for constrained forest problems, SIAM J. Comput., 24(2), 296, 1995.
8. Awerbuch, B., Azar, Y., Blum, A., and Vempala, S., New approximation guarantees for minimumweight k-trees and prize-collecting salesmen, SIAM J. Comput., 28(1), 254, 1999.
9. Ausiello, G., Leonardi, S., and Marchetti-Spaccamela, A., On salesmen, repairmen, spiders, and other traveling agents, Proc. 4th Italian Conf. on Algorithms and Complexity, Lecture Notes in Computer Science, Vol. 1767, Springer, Berlin, 2000, p. 1.
10. Gabow, H. N. and Pettie, S., The dynamic vertex minimum problem and its application to clustering type approximation algorithms, Proc. 8th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Vol. 2368, Springer, Berlin, 2002, p. 190.
11. Bienstock, D., Goemans, M. X., Simchi-Levi, D., and Williamson, D., A note on the prize collecting traveling salesman problem, Math. Prog., 59(3), 413, 1993.
12. Bern, M. W. and Plassmann, P. E., The Steiner problem with edge lengths 1 and 2, Inf. Proc. Lett., 32(4), 171, 1989.
13. Papadimitriou, C. H. and Yannakakis, M., The traveling salesman problem with distances one and two, Math. Oper. Res., 18(1), 1, 1993.
14. Fischetti, M., Hamacher, H.W., Jørnsten, K., andMaffioli, F., Weighted k-cardinality trees: complexity and polyhedral structure, Networks, 24(1), 11, 1994.
15. Cheung, S. Y. and Kumar, A., Efficient quorumcast routing algorithms, Proc. of INFOCOM, 2, 1994, 840.
16. Ravi, R., Sundaram, R., Marathe, M. V., Rosenkrantz, D. J., and Ravi, S. S., Spanning trees short or small, SIAM J. Disc. Math., 9(2), 178, 1996.
17. Blum, A., Ravi, R., and Vempala, S., A constant-factor approximation algorithm for the k-MST problem, JCSS, 58(1), 101, 1999.
18. Golden, B. L., Levy, L., and Vohra, R., The orienteering problem, Nav. Res. Logistics, 34, 307, 1987.
19. Blum, A., Chawla, S., Karger, D. R., Lane, T., Meyerson, A., and Minkoff, M., Approximation algorithms for orienteering and discounted-reward TSP, Proc. FOCS, 2003, p. 46.
20. Chaudhuri, K., Godfrey, B., Rao, S., and Talwar, K., Paths, trees, and minimum latency tours, Proc. FOCS, 2003, p. 36.
21. Bansal, N., Blum, A., Chalasani, P., and Meyerson, A., Approximation algorithms for deadline-tsp and vehicle routing with time-windows, Proc. STOC, 2004, p. 166.
22. Johnson, D. S., Minkoff, M., and Phillips, S., The prize collecting steiner tree problem: theory and practice, Proc. SODA, 2000, p. 760.
23. Chudak, F. A., Roughgarden, T., andWilliamson, D. P., Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation, Math. Prog., 100(2), 411, 2004.
24. Balas, E., The prize collecting traveling salesman problem: II. Polyhedral results, Networks, 25, 199, 1995.
25. Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, W. R., Raghavan, P., and Sudan, M., The minimum latency problem, Proc. of STOC, 1994, p. 163.
26. Will, T. G., Extremal Results and Algorithms for Degree Sequences ofGraphs, Ph.D. thesis, University of Illinois at Urbana-Champaign, 1993.
27. Minieka, E., The deliver man problem on a tree network, Ann. Oper. Res., 18, 261, 1989.
28. Fischetti, M., Laporte, G., and Martello, S., The delivery man problem and cumulative matroids, Oper. Res., 41(6), 1055, 1993.
29. Koutsoupias, E., Papadimitriou, C. H., and Yannakakis, M., Searching a fixed graph, Proc. of ICALP, Lecture Notes in Computer Science, Vol. 1099, Springer, 1996, p. 280.
30. Sahni, S. and Gonzalez, T. F., P-complete approximation problems, JACM, 23(3), 555, 1976.
31. Afrati, F. N., Cosmadakis, S. S., Papadimitriou, C. H., Papageorgiou, G., and Papakostantinou, N., The complexity of the travelling repairman problem, Informatique Théorique Appl., 20(1), 79, 1986.
32. Sitters, R., The minimum latency problem is NP-hard for weighted trees, Proc. 9th Integer Programming and Combinatorial Optimization Conf., 2002, p. 230.
33. Goemans, M. and Kleinberg, J., An improved approximation ratio for the minimumlatency problem, Math. Prog., 82(1), 111, 1998.
34. Arora, S. and Karakostas, G., Approximation schemes for minimum latency problems, SIAM J. Comput., 32(5), 1317, 2003.
35. Fakcharoenphol, J., Harrelson, C., and Rao, S., The k-traveling repairman problem, Proc. SODA, 2003, p. 655.
36. Archer, A., Levin, A., and Williamson, D. P., A Faster, Better Approximation Algorithm for the Minimum Latency Problem, Technical report 1362, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 2003.