Prize-collecting Network Design on Planar Graphs

In this paper, we reduce Prize-Collecting Steiner TSP (PCTSP), Prize-Collecting Stroll (PCS), Prize-Collecting Steiner Tree (PCST), Prize-Collecting Steiner Forest (PCSF) and more generally Submodular Prize-Collecting Steiner Forest (SPCSF) on planar graphs (and more generally bounded-genus graphs) to the same problems on graphs of bounded treewidth. More precisely, we show any $\alpha$-approximation algorithm for these problems on graphs of bounded treewidth gives an $(\alpha + \epsilon)$-approximation algorithm for these problems on planar graphs (and more generally bounded-genus graphs), for any constant $\epsilon > 0$. Since PCS, PCTSP, and PCST can be solved exactly on graphs of bounded treewidth using dynamic programming, we obtain PTASs for these problems on planar graphs and bounded-genus graphs. In contrast, we show PCSF is APX-hard to approximate on series-parallel graphs, which are planar graphs of treewidth at most 2. This result is interesting on its own because it gives the first provable hardness separation between prize-collecting and non-prize-collecting (regular) versions of the problems: regular Steiner Forest is known to be polynomially solvable on series-parallel graphs and admits a PTAS on graphs of bounded treewidth. An analogous hardness result can be shown for Euclidian PCSF. This ends the common belief that prize-collecting variants should not add any new hardness to the problems.

[1]  G. Nemhauser,et al.  Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

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

[3]  Mohammad Taghi Hajiaghayi,et al.  Euclidean Prize-Collecting Steiner Forest , 2011, Algorithmica.

[4]  Bojan Mohar,et al.  Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs , 2007, Discret. Comput. Geom..

[5]  Paul D. Seymour,et al.  Graph Minors. XI. Circuits on a Surface , 1994, J. Comb. Theory, Ser. B.

[6]  Uriel Feige,et al.  Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[7]  Kamal Jain,et al.  A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[8]  David S. Johnson,et al.  The prize collecting Steiner tree problem: theory and practice , 2000, SODA '00.

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

[10]  Vijay V. Vazirani,et al.  Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.

[11]  Philip N. Klein,et al.  A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights , 2008, SIAM J. Comput..

[12]  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).

[13]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

[14]  Carsten Thomassen,et al.  Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

[15]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[16]  David P. Williamson,et al.  A Faster, Better Approximation Algorithm for the Minimum Latency Problem , 2008, SIAM J. Comput..

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

[18]  Philip N. Klein,et al.  A polynomial-time approximation scheme for Steiner tree in planar graphs , 2007, SODA '07.

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

[20]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[21]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

[22]  Mohammad Taghi Hajiaghayi,et al.  Prize-Collecting Steiner Networks via Iterative Rounding , 2010, LATIN.

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

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

[25]  Jack Edmonds,et al.  Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.

[26]  Naveen Garg,et al.  Saving an epsilon: a 2-approximation for the k-MST problem in graphs , 2005, STOC '05.

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

[28]  Arie M. C. A. Koster,et al.  Combinatorial Optimization on Graphs of Bounded Treewidth , 2008, Comput. J..

[29]  Philip N. Klein,et al.  A polynomial-time approximation scheme for weighted planar graph TSP , 1998, SODA '98.

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

[31]  Kamal Jain.  A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 2001, Comb..

[32]  Christos H. Papadimitriou,et al.  An approximation scheme for planar graph TSP , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[33]  David P. Williamson,et al.  A note on the prize collecting traveling salesman problem , 1993, Math. Program..

[34]  R. Ravi,et al.  Approximating the Single-Sink Link-Installation Problem in Network Design , 2001, SIAM J. Optim..

[35]  Viggo Kann,et al.  Some APX-completeness results for cubic graphs , 2000, Theor. Comput. Sci..

[36]  Maurice Queyranne,et al.  A combinatorial algorithm for minimizing symmetric submodular functions , 1995, SODA '95.

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

[38]  R. Ravi,et al.  An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem , 2007, SODA '07.

[39]  A. J.,et al.  Analysis of Christofides ' heuristic : Some paths are more difficult than cycles , 2002 .

[40]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

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

[42]  Chandra Chekuri,et al.  Prize-Collecting Steiner Tree and Forest in Planar Graphs , 2010, ArXiv.

[43]  Sunil Arya,et al.  A 2.5-Factor Approximation Algorithm for the k-MST Problem , 1998, Inf. Process. Lett..

[44]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[45]  Tim Roughgarden,et al.  Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation , 2001, Math. Program..

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

[47]  Satoru Iwata,et al.  A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.

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

[49]  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.

[50]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.