An improved algorithm for the Steiner tree problem with bounded edge-length

Abstract This work firstly studies the Steiner tree problem with bounded edge-length d in which d is the ratio of the maximum edge cost to the minimum edge cost. This work analyzes the algorithm of Byrka et al. [19] and shows that the approximation ratio of d ln ⁡ 4 d + ln ⁡ 4 − 1 + ϵ for general graphs and approximation ratio of 73 ⋅ d 60 ⋅ d + 13 + ϵ for quasi-bipartite graphs. The algorithm implies approximation ratio of 1.162 + ϵ for the problem on complete graphs with edge distances 1 and 2. This finding represents an improvement upon the previous best approximation ratio of 1.25. This work then presents a combinatorial two-phase heuristic for the general Steiner tree in greedy strategy that achieves an approximation ratio of 1.4295.

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

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

[3]  Yen Hung Chen.  An Improved Approximation Algorithm for the Terminal Steiner Tree Problem , 2011, ICCSA.

[4]  Hans Jürgen Prömel,et al.  RNC-Approximation Algorithms for the Steiner Problem , 1997, STACS.

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

[6]  Fabrizio Grandoni,et al.  Steiner Tree Approximation via Iterative Randomized Rounding , 2013, JACM.

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

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

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

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

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

[12]  Sun-Yuan Hsieh,et al.  An Efficient Approximation Algorithm for the Steiner Tree Problem , 2020, Complexity and Approximation.

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

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

[15]  Aravind Srinivasan,et al.  Integrality ratio for group Steiner trees and directed steiner trees , 2003, SODA '03.

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

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

[18]  Chao-Wen Huang,et al.  The internal Steiner tree problem: Hardness and approximations , 2013, J. Complex..

[19]  Marek Karpinski,et al.  1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2 , 2009, WADS.

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

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

[22]  Sun-Yuan Hsieh,et al.  On the partial terminal Steiner tree problem , 2007, 2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008).