An improved LP-based approximation for steiner tree

The Steiner tree problem is one of the most fundamental NP-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree spanning the terminals. In a sequence of papers, the approximation ratio for this problem was improved from 2 to the current best 1.55 [Robins,Zelikovsky-SIDMA'05]. All these algorithms are purely combinatorial. A long-standing open problem is whether there is an LP-relaxation for Steiner tree with integrality gap smaller than 2 [Vazirani,Rajagopalan-SODA'99]. In this paper we improve the approximation factor for Steiner tree, developing an LP-based approximation algorithm. Our algorithm is based on a, seemingly novel, iterative randomized rounding technique. We consider a directed-component cut relaxation for the k-restricted Steiner tree problem. We sample one of these components with probability proportional to the value of the associated variable in the optimal fractional solution and contract it. We iterate this process for a proper number of times and finally output the sampled components together with a minimum-cost terminal spanning tree in the remaining graph. Our algorithm delivers a solution of cost at most ln(4) times the cost of an optimal k-restricted Steiner tree. This directly implies a ln(4)+ε<1.39 approximation for Steiner tree. As a byproduct of our analysis, we show that the integrality gap of our LP is at most $1.55$, hence answering to the mentioned open question. This might have consequences for a number of related problems.

[1]  E. Chong,et al.  Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .

[2]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[3]  Felix Schlenk,et al.  Proof of Theorem 3 , 2005 .

[4]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[5]  Tim Roughgarden,et al.  Approximation via cost sharing , 2007, J. ACM.

[6]  Miroslav Chleb ´ õk,et al.  The Steiner tree problem on graphs: inapproximability results , 2008 .

[7]  Amit Kumar,et al.  Provisioning a virtual private network: a network design problem for multicommodity flow , 2001, STOC '01.

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

[9]  Sudipto Guha,et al.  Improved Combinatorial Algorithms for Facility Location Problems , 2005, SIAM J. Comput..

[10]  Vijay V. Vazirani,et al.  On the bidirected cut relaxation for the metric Steiner tree problem , 1999, SODA '99.

[11]  András Frank,et al.  An application of simultaneous diophantine approximation in combinatorial optimization , 1987, Comb..

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

[13]  Alex Zelikovsky,et al.  Tighter Bounds for Graph Steiner Tree Approximation , 2005, SIAM J. Discret. Math..

[14]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[15]  Siavash Vahdati Daneshmand,et al.  On Steiner trees and minimum spanning trees in hypergraphs , 2003, Oper. Res. Lett..

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

[17]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[18]  András Frank,et al.  Preserving and Increasing Local Edge-Connectivity in Mixed Graphs , 1995, SIAM J. Discret. Math..

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

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

[21]  Friedrich Eisenbrand,et al.  An improved approximation algorithm for virtual private network design , 2005, SODA '05.

[22]  Hans Jürgen Prömel,et al.  A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3 , 2000, J. Algorithms.

[23]  Marshall W. Bern,et al.  The Steiner Problem with Edge Lengths 1 and 2 , 1989, Inf. Process. Lett..

[24]  Stefan Richter,et al.  A Faster Algorithm for the Steiner Tree Problem , 2006, STACS.

[25]  Miroslav Chlebík,et al.  The Steiner tree problem on graphs: Inapproximability results , 2008, Theor. Comput. Sci..

[26]  S. Janson,et al.  Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .

[27]  S. E. Dreyfus,et al.  The steiner problem in graphs , 1971, Networks.

[28]  Marek Karpinski,et al.  New Approximation Algorithms for the Steiner Tree Problems , 1997, J. Comb. Optim..

[29]  Friedrich Eisenbrand,et al.  Connected facility location via random facility sampling and core detouring , 2010, J. Comput. Syst. Sci..

[30]  Nikhil R. Devanur,et al.  New geometry-inspired relaxations and algorithms for the metric Steiner tree problem , 2008, Math. Program..

[31]  Fabrizio Grandoni,et al.  Improved Approximation for Single-Sink Buy-at-Bulk , 2006, ISAAC.

[32]  Kunal Talwar,et al.  The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap , 2002, IPCO.

[33]  Martin Skutella,et al.  New Approaches for Virtual Private Network Design , 2005, SIAM J. Comput..

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

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

[36]  Ding-Zhu Du,et al.  The k-Steiner Ratio in Graphs , 1997, SIAM J. Comput..

[37]  Romeo Rizzi,et al.  On Rajagopalan and Vazirani's 3/2-approximation bound for the Iterated 1-Steiner heuristic , 2003, Inf. Process. Lett..

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

[39]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[40]  Friedrich Eisenbrand,et al.  Approximating connected facility location problems via random facility sampling and core detouring , 2008, SODA '08.

[41]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[42]  Michel X. Goemans,et al.  A catalog of steiner tree formulations , 1993, Networks.

[43]  Chaitanya Swamy,et al.  Primal–Dual Algorithms for Connected Facility Location Problems , 2004, Algorithmica.

[44]  Hans Jürgen Prömel,et al.  The Steiner Tree Problem , 2002 .

[45]  David Pritchard,et al.  A partition-based relaxation for Steiner trees , 2007, Math. Program..

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

[47]  Chandra Chekuri,et al.  Approximate Integer Decompositions for Undirected Network Design Problems , 2008, SIAM J. Discret. Math..

[48]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[49]  Alex Zelikovsky,et al.  An 11/6-approximation algorithm for the network steiner problem , 1993, Algorithmica.

[50]  K. Chao,et al.  Steiner Minimal Trees , 2005 .