Prize-Collecting Steiner Tree and Forest in Planar Graphs

We obtain polynomial-time approximation-preserving reductions (up to a factor of 1 + \epsilon) from the prize-collecting Steiner tree and prize-collecting Steiner forest problems in planar graphs to the corresponding problems in graphs of bounded treewidth. We also give an exact algorithm for the prize-collecting Steiner tree problem that runs in polynomial time for graphs of bounded treewidth. This, combined with our reductions, yields a PTAS for the prize-collecting Steiner tree problem in planar graphs and generalizes the PTAS of Borradaile, Klein and Mathieu for the Steiner tree problem in planar graphs. Our results build upon the ideas of Borradaile, Klein and Mathieu and the work of Bateni, Hajiaghayi and Marx on a PTAS for the Steiner forest problem in planar graphs. Our main technical result is on the properties of primal-dual algorithms for Steiner tree and forest problems in general graphs when they are run with scaled up penalties.

[1]  Mohammad Taghi Hajiaghayi,et al.  The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema , 2006, SODA '06.

[2]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[3]  Fabrizio Grandoni,et al.  An improved LP-based approximation for steiner tree , 2010, STOC '10.

[4]  Sanjeev Arora,et al.  A 2 + ɛ approximation algorithm for the k-MST problem , 2000, SODA '00.

[5]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[6]  Naveen Garg,et al.  A 3-approximation for the minimum tree spanning k vertices , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[7]  Philip N. Klein,et al.  A Subset Spanner for Planar Graphs, with Application to Subset Tsp , 2022 .

[8]  Mohammad Taghi Hajiaghayi,et al.  Prize-collecting Network Design on Planar Graphs , 2010, ArXiv.

[9]  David R. Karger,et al.  Approximation algorithms for orienteering and discounted-reward TSP , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[10]  Mohammad Taghi Hajiaghayi,et al.  Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth , 2010, STOC '10.

[11]  Satish Rao,et al.  Paths, trees, and minimum latency tours , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[12]  Adam Meyerson,et al.  Approximation algorithms for deadline-TSP and vehicle routing with time-windows , 2004, STOC '04.

[13]  Chaitanya Swamy,et al.  Approximation algorithms for prize collecting forest problems with submodular penalty functions , 2007, SODA '07.

[14]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[15]  Philip N. Klein,et al.  An O(n log n) approximation scheme for Steiner tree in planar graphs , 2009, TALG.

[16]  Erik D. Demaine,et al.  Approximation Schemes for Planar Graph Problems , 2008, Encyclopedia of Algorithms.

[17]  R. Ravi,et al.  When trees collide: an approximation algorithm for the generalized Steiner problem on networks , 1991, STOC '91.

[18]  Chandra Chekuri,et al.  Improved algorithms for orienteering and related problems , 2008, SODA '08.

[19]  David P. Williamson,et al.  Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements , 2008, WAOA.

[20]  Mohammad Taghi Hajiaghayi,et al.  Prize-collecting steiner network problems , 2010, TALG.

[21]  Joseph S. B. Mitchell,et al.  Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems , 1999, SIAM J. Comput..

[22]  Erik D. Demaine,et al.  Approximation algorithms via contraction decomposition , 2007, SODA '07.

[23]  Mohammad Taghi Hajiaghayi,et al.  Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[24]  Mohammad Taghi Hajiaghayi,et al.  Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth , 2009, JACM.

[25]  Shai Gutner,et al.  Elementary approximation algorithms for prize collecting Steiner tree problems , 2008, Inf. Process. Lett..

[26]  Hans L. Bodlaender.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC '93.

[27]  R. Ravi,et al.  When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks , 1995, SIAM J. Comput..