Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

2-Approximation for Prize-Collecting Steiner Forest (2309.05172v2)

Published 11 Sep 2023 in cs.DS

Abstract: Approximation algorithms for the prize-collecting Steiner forest problem (PCSF) have been a subject of research for over three decades, starting with the seminal works of Agrawal, Klein, and Ravi and Goemans and Williamson on Steiner forest and prize-collecting problems. In this paper, we propose and analyze a natural deterministic algorithm for PCSF that achieves a $2$-approximate solution in polynomial time. This represents a significant improvement compared to the previously best known algorithm with a $2.54$-approximation factor developed by Hajiaghayi and Jain in 2006. Furthermore, K{\"{o}}nemann, Olver, Pashkovich, Ravi, Swamy, and Vygen have established an integrality gap of at least $9/4$ for the natural LP relaxation for PCSF. However, we surpass this gap through the utilization of a combinatorial algorithm and a novel analysis technique. Since $2$ is the best known approximation guarantee for Steiner forest problem, which is a special case of PCSF, our result matches this factor and closes the gap between the Steiner forest problem and its generalized version, PCSF.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (27)
  1. When trees collide: An approximation algorithm for the generalized steiner problem on networks. In Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, STOC ’91, page 134–144, New York, NY, USA, 1991. Association for Computing Machinery.
  2. When trees collide: An approximation algorithm for the generalized steiner problem on networks. SIAM J. Comput., 24(3):440–456, 1995.
  3. Improved approximation algorithms for prize-collecting steiner tree and TSP. SIAM J. Comput., 40(2):309–332, 2011.
  4. E. Balas. The prize collecting traveling salesman problem. Networks, 19(6):621–636, 1989.
  5. M. Bateni and M. Hajiaghayi. Euclidean prize-collecting steiner forest. Algorithmica, 62(3-4):906–929, 2012.
  6. Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. J. ACM, 58(5):21:1–21:37, 2011.
  7. The steiner problem with edge lengths 1 and 2. Inf. Process. Lett., 32(4):171–176, 1989.
  8. A note on the prize collecting traveling salesman problem. Math. Program., 59:413–420, 1993.
  9. A better-than-1.6-approximation for prize-collecting TSP. CoRR, abs/2308.06254, 2023.
  10. J. Blauth and M. Nägele. An improved approximation guarantee for prize-collecting TSP. In B. Saha and R. A. Servedio, editors, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, pages 1848–1861. ACM, 2023.
  11. An improved lp-based approximation for steiner tree. In L. J. Schulman, editor, Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pages 583–592. ACM, 2010.
  12. M. Chlebík and J. Chlebíková. The steiner tree problem on graphs: Inapproximability results. Theor. Comput. Sci., 406(3):207–214, 2008.
  13. M. X. Goemans. Combining approximation algorithms for the prize-collecting TSP. CoRR, abs/0910.0553, 2009.
  14. A general approximation technique for constrained forest problems. In Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’92, page 307–316, USA, 1992. Society for Industrial and Applied Mathematics.
  15. A general approximation technique for constrained forest problems. SIAM J. Comput., 24(2):296–317, 1995.
  16. An efficient cost-sharing mechanism for the prize-collecting steiner forest problem. In N. Bansal, K. Pruhs, and C. Stein, editors, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pages 1153–1162. SIAM, 2007.
  17. A. Gupta and A. Kumar. Greedy algorithms for steiner forest. In R. A. Servedio and R. Rubinfeld, editors, Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, pages 871–878. ACM, 2015.
  18. M. Hajiaghayi and A. A. Nasri. Prize-collecting steiner networks via iterative rounding. In A. López-Ortiz, editor, LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings, volume 6034 of Lecture Notes in Computer Science, pages 515–526. Springer, 2010.
  19. M. T. Hajiaghayi and K. Jain. The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pages 631–640. ACM Press, 2006.
  20. Prize-collecting steiner network problems. ACM Trans. Algorithms, 9(1):2:1–2:13, 2012.
  21. D. S. Hochbaum, editor. Approximation Algorithms for NP-Hard Problems. PWS Publishing Co., USA, 1996.
  22. R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Proceedings of a symposium on the Complexity of Computer Computations, held March 20-22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, USA, The IBM Research Symposia Series, pages 85–103. Plenum Press, New York, 1972.
  23. M. Karpinski and A. Zelikovsky. New approximation algorithms for the steiner tree problems. J. Comb. Optim., 1(1):47–65, 1997.
  24. On the integrality gap of the prize-collecting steiner forest LP. In K. Jansen, J. D. P. Rolim, D. Williamson, and S. S. Vempala, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA, volume 81 of LIPIcs, pages 17:1–17:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
  25. G. Robins and A. Zelikovsky. Tighter bounds for graph steiner tree approximation. SIAM J. Discret. Math., 19(1):122–134, 2005.
  26. Approximation algorithms for prize collecting forest problems with submodular penalty functions. In N. Bansal, K. Pruhs, and C. Stein, editors, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pages 1275–1284. SIAM, 2007.
  27. A. Zelikovsky. An 11/6-approximation algorithm for the network steiner problem. Algorithmica, 9(5):463–470, 1993.
Citations (5)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets