Steiner trees in uniformly quasi-bipartite graphs

The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation algorithm has a performance ratio of 1.550. This is still far away from 1.0074, the largest known lower bound on the achievable performance ratio. As all instances resulting from known lower bound reductions are uniformly quasi-bipartite, it is interesting whether this special case can be approximated better than the general case. We present an approximation algorithm with performance ratio 73/60 > 1.217 for the uniformly quasi-bipartite case. This improves on the previously known ratio of 1.279 of Robins and Zelikovsky. We use a new method of analysis that combines ideas from the greedy algorithm for set cover with a matroid-style exchange argument to model the connectivity constraint. As a consequence, we are able to provide a tight instance.

[1]  Alex Zelikovsky,et al.  Improved Steiner tree approximation in graphs , 2000, SODA '00.

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

[3]  Laurence A. Wolsey,et al.  An analysis of the greedy algorithm for the submodular set covering problem , 1982, Comb..

[4]  S. Hougardy,et al.  Approximation Algorithms for the Steiner Tree Problem in Graphs , 2001 .

[5]  H. Pollak,et al.  Steiner Minimal Trees , 1968 .

[6]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[7]  V. J. Rayward-Smith,et al.  The computation of nearly minimal Steiner trees in graphs , 1983 .

[8]  A. Zelikovsky.  Better approximation bounds for the network and Euclidean Steiner tree problems , 1996 .

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

[10]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[11]  Martin Thimm,et al.  On the approximability of the Steiner tree problem , 2003, Theor. Comput. Sci..

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

[13]  Kurt Mehlhorn,et al.  A Faster Approximation Algorithm for the Steiner Problem in Graphs , 1988, Inf. Process. Lett..

[14]  Hans Jürgen Prömel,et al.  Lower Bounds for Approximation Algorithms for the Steiner Tree Problem , 2001, WG.

[15]  D. Du,et al.  Steiner Trees in Industry , 2002 .

[16]  Hans Jürgen Prömel,et al.  A 1.598 approximation algorithm for the Steiner problem in graphs , 1999, SODA '99.

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

[18]  Piotr Berman,et al.  Improved approximations for the Steiner tree problem , 1992, SODA '92.

[19]  H. Prömel,et al.  Approximating Minimum Spanning Sets in Hypergraphs and Polymatroids , 2000 .

[20]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.