Improved approximation algorithms for prize-collecting steiner tree and tsp

SIAM Journal on Computing

Volumn 40, Issue 2, 2011, Pages 309-332

  Archer, Aaron ^a   Bateni, Mohammadhossein ^b   Hajiaghayi, Mohammadtaghi ^a   Karloff, Howard ^a  

^a AT AND T LABS RESEARCH   (United States)

^b Princeton University   (United States)

Author keywords

Approximation algorithms; Prize collecting; Steiner tree; Traveling salesman

Indexed keywords

APPROXIMATION RATIOS; AT AND T; INTEGRALITY GAPS; LINEAR PROGRAMMING RELAXATION; OPTIMIZATION PROBLEMS; PRIZE-COLLECTING; STEINER TREE; STEINER TREES; THREE PROBLEMS; TRAVELING SALESMAN;

LINEAR PROGRAMMING; OPTIMIZATION; PLANT EXTRACTS; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS;

EID: 79957500696     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/090771429     Document Type: Article

References (34)

1. A. Agrawal, P. Klein, and R. Ravi, When trees collide: An approximation algorithm for the generalized Steiner problem on networks, SIAM J. Comput., 24 (1995), pp. 440-456.
2. A. Archer, M. Bateni, M. Hajiaghayi, and H. Karloff, Improved approximation algorithms for prize-collecting Steiner tree and TSP, in Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009, pp. 427-436.
3. A. Archer and A. Blasiak, Improved approximation algorithms for the minimum latency problem via prize-collecting strolls, in Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, 2010, pp. 429-447.
4. A. Archer, A. Levin, and D. P. Williamson, A faster, better approximation algorithm for the minimum latency problem, SIAM J. Comput., 37 (2008), pp. 1472-1498.
5. S. Arora and G. Karakostas, A 2 + ε approximation algorithm for the κ-MST problem, Math. Program., 107 (2006), pp. 491-504.
6. S. Arya and H. Ramesh, A 2.5 factor approximation algorithm for the κ-MST problem, Inform. Process. Lett., 65 (1998), pp. 117-118. (Pubitemid 128392727)
7. E. Balas, The prize collecting traveling salesman problem, Networks, 19 (1989), pp. 621-636.
8. P. Berman and V. Ramaiyer, Improved approximations for the Steiner tree problem, in Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, 1992, pp. 325-334.
9. D. Bienstock, M. X. Goemans, D. Simchi-Levi, and D. P. Williamson, A note on the prize collecting traveling salesman problem, Math. Program, 59 (1993), pp. 413-420. (Pubitemid 23698090)
10. J. Byrka, F. Grandoni, T. Rothvoß, and L. Sanità, An improved LP-based approximation for Steiner tree, in Proceedings of the 42nd Annual ACM Symposium on Theory of Computing, 2010, pp. 583-592.
11. M. Charikar and S. Guha, Improved combinatorial algorithms for facility location problems, SIAM J. Comput., 34 (2005), pp. 803-824. (Pubitemid 41246994)
12. K. Chaudhuri, B. Godfrey, S. Rao, and K. Talwar, Paths, trees, and minimum latency tours, in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003, pp. 36-45.
13. N. Christofides, Worst-Case Analysis of a New Heuristic for the Travelling-Salesman Problem, Technical report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1976.
14. F. A. Chudak, T. Roughgarden, and D. P. Williamson, Approximate κ-MSTs and κ-Steiner trees via the primal-dual method and Lagrangean relaxation, Math. Program., 100 (2004), pp. 411-421. (Pubitemid 40878094)
15. P. Feofiloff, C. G. Fernandes, C. E. Ferreira, and J. C. de Pina, A note on Johnson, Minkoff and Phillips' algorithm for the prize-collecting Steiner tree problem, arXiv:1004.1437v2 [cs.DS], (2010).
16. H. N. Gabow and S. Pettie, The dynamic vertex minimum problem and its application to clustering-type approximation algorithms, in Proceedings of the Eighth Scandinavian Workshop on Algorithm Theory, 2002, pp. 190-199.
17. N. Garg, A 3-approximation for the minimum tree spanning k vertices, in Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, pp. 302-309.
18. N. Garg, Saving an epsilon: A 2-approximation for the κ-MST problem in graphs, in Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005, pp. 396-402. (Pubitemid 43098610)
19. M. X. Goemans, Combining approximation algorithms for the prize-collecting TSP, arXiv:0910.0553v1 [cs.DS], (2009).
20. M. X. Goemans and D. P. Williamson, A general approximation technique for constrained forest problems, in Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, 1992, pp. 307-316.
21. M. X. Goemans and D. P. Williamson, A general approximation technique for constrained forest problems, SIAM J. Comput., 24 (1995), pp. 296-317.
22. A. Hayrapetyan, C. Swamy, and É. Tardos, Network design for information networks, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 2005, pp. 933-942. (Pubitemid 40851460)
23. J. Hoogeveen, Analysis of Christofides' heuristic: Some paths are more difficult than cycles, Oper. Res. Lett., 10 (1991), pp. 291-295.
24. S. Hougardy and H. J. Prömel, A 1.598 approximation algorithm for the Steiner problem in graphs, in Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999, pp. 448-453.
25. K. Jain and V. V. Vazirani, Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation, J. ACM, 48 (2001), pp. 274-296.
26. D. S. Johnson, M. Minkoff, and S. Phillips, The prize collecting Steiner tree problem: Theory and practice, in Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 760-769. (Pubitemid 30549327)
27. M. Jünger and W. R. Pulleyblank, New primal and dual matching heuristics, Algorithmica, 13 (1995), pp. 357-386.
28. M. Karpinski and A. Zelikovsky, New approximation algorithms for the Steiner tree problems, J. Comb. Optim., 1 (1997), pp. 47-65. (Pubitemid 127715942)
29. H. J. Prömel and A. Steger, RNC-approximation algorithms for the Steiner problem, in Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, 1997, pp. 559-570. (Pubitemid 127044181)
30. G. Robins and A. Zelikovsky, Improved Steiner tree approximation in graphs, in Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 770-779. (Pubitemid 30549328)
31. G. Robins and A. Zelikovsky, Tighter bounds for graph Steiner tree approximation, SIAM J. Discrete Math., 19 (2005), pp. 122-134.
32. A. Zelikovsky, An 11/6-approximation for the Steiner problem on graphs, in Proceedings of the 4th Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity (1990), Ann. Discrete Math. 51, North-Holland, Amsterdam, 1992, pp. 351-354.
33. A. Zelikovsky, An 11/6-approximation algorithm for the network Steiner problem, Algorithmica, 9 (1993), pp. 463-470.
34. A. Zelikovsky, Better Approximation Bounds for the Network and Euclidean Steiner Tree Problems, Technical report, University of Virginia, Charlottesville, VA, 1996.