Improved approximation algorithms for PRIZE-COLLECTING STEINER TREE and TSP

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2009, Pages 427-436

  Archer, Aaron ^a   Bateni, Mohammad Hossein ^b   Hajiaghayi, Mohammad Taghi ^a   Karloff, Howard ^a  

^a AT AND T LABS RESEARCH   (United States)

^b Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGRALITY GAPS; LINEAR PROGRAMMING RELAXATION; OPTIMIZATION PROBLEMS; PRIZE-COLLECTING; REAL-WORLD; STEINER TREES; THREE PROBLEMS; TRAVELING SALESMAN;

COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS; LINEAR PROGRAMMING; LINEARIZATION; OPTIMIZATION; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS;

EID: 77952418184     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2009.39     Document Type: Conference Paper

References (30)

1. A. Agrawal, P. N. Klein, and R. Ravi, "When trees collide: An approximation algorithm for the generalized Steiner problem on networks," SIAM J. on Computing, 24:440-456, 1995.
2. A. Archer, A. Levin, and D. P. Williamson, "A faster, better approximation algorithm for the minimum latency problem," SIAM J. on Computing, 37: 1472-1498, 2008.
3. S. Arora and G. Karakostas, "A 2+∈ approximation algorithm for the k-MST problem," Mathematical Programming, 107: 491-504, 2006.
4. S. Arya and H. Ramesh, "A 2.5 factor approximation algorithm for the k-MST problem," Information Processing Letters, 65: 117-118, 1998.
5. E. Balas, "The prize collecting traveling salesman problem," Networks, 19: 621-636, 1989.
6. P. Berman and V. Ramaiyer, "Improved approximations for the Steiner tree problem," in Proceedings of SODA 1992, 325-334.
7. D. Bienstock, M. X. Goemans, D. Simchi-Levi, and D. P. Williamson, "A note on the prize collecting traveling salesman problem." Mathematical Programming, 59, 413-420, 1993.
8. K. Chaudhuri, B. Godfrey, S. Rao, and K. Talwar, "Paths, trees, and minimum latency tours," in Proceedings of FOCS 2003, 36-45.
9. N. Christofides, "Worst-case analysis of a new heuristic for the travelling-salesman problem," Graduate School of Industrial Administration, Carnegie-Mellon University, Tech. Rep., 1976.
10. F. A. Chudak, T. Roughgarden, and D. P. Williamson, "Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation," Mathematical Programming, 100: 411-421, 2004.
11. 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," 2006, manuscript available from http://www.ime.usp. br/cris/publ/jmp-analysis.ps.gz.
12. -, "Primal-dual approximation algorithms for the prize-collecting Steiner tree problem," Information Processing Letters, 103: 195-202, 2007.
13. N. Garg, "A 3-approximation for the minimum tree spanning k vertices," in Proceedings of FOCS 1996, 302-309.
14. -, "Saving an epsilon: a 2-approximation for the k-MST problem in graphs," in Proceedings of STOC 2005, 396-402.
15. M. Goemans, "The prize-collecting TSP revisited," Available from http://www-math.mit.edu/goemans/prizecollect.ps, talk slides from the 1998 SIAM Discrete Math conference.
16. M. X. Goemans, "Combining approximation algorithms for prize-collecting TSP," unpublished manuscript, 2009.
17. M. X. Goemans and D. P. Williamson, "A general approximation technique for constrained forest problems," in Proceedings of SODA 1992, 307-316.
18. -, "A general approximation technique for constrained forest problems," SIAM J. on Computing, 24: 296-317, 1995.
19. A. Hayrapetyan, C. Swamy and É. Tardos, "Network design for information networks," Proceedings of SODA 2005, 933-942.
20. J. Hoogeveen, "Analysis of Christofides' heuristic: Some paths are more difficult than cycles," Operations Research Letters, 10: 291-295, July 1991.
21. S. Hougardy and H. J. Prömel, "A 1.598 approximation algorithm for the Steiner problem in graphs," in Proceedings of SODA 1999, 448-453.
22. 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. of the ACM, 48: 274-296, 2001.
23. D. S. Johnson, M. Minkoff, and S. Phillips, "The prize collecting Steiner tree problem: theory and practice." in Proceedings of SODA 2000, 760-769.
24. M. Jünger and W. R. Pulleyblank, "New primal and dual matching heuristics," Algorithmica, 13: 357-386, 1995.
25. M. Karpinski and A. Zelikovsky, "New approximation algorithms for the Steiner tree problems," J. of Combinatorial Optimization, 1, 47-65, 1997. (Pubitemid 127715942)
26. H. J. Prömel and A. Steger, "RNC-approximation algorithms for the Steiner problem," in Proceedings of STACS 1997, 559-570.
27. G. Robins and A. Zelikovsky, "Tighter bounds for graph Steiner tree approximation." SIAM J. Discrete Mathematics, 19: 122-134, 2005.
28. A. Zelikovsky, "An 11/6-approximation for the Steiner problem on graphs," in Proceedings of the Czechoslovakian Symposium on Combinatorics, Graphs, and Complexity (1990) published in Annals of Discrete Mathematics, 51: 351-354, 1992.
29. -, "An 11/6-approximation algorithm for the network Steiner problem," Algorithmica, 9: 463-470, 1993.
30. -, "Better approximation bounds for the network and Euclidean Steiner tree problems," University of Virginia, Charlottesville, VA, USA, Tech. Rep., 1996.