An Efficient Approximation Algorithm for the Steiner Tree Problem

[1]  Guohui Lin,et al.  On the terminal Steiner tree problem , 2002, Inf. Process. Lett..

[2]  Andrew B. Kahng,et al.  On wirelength estimations for row-based placement , 1998, ISPD '98.

[3]  Weifa Liang,et al.  Constructing minimum-energy broadcast trees in wireless ad hoc networks , 2002, MobiHoc '02.

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

[5]  Robert Krauthgamer,et al.  Polylogarithmic inapproximability , 2003, STOC '03.

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

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

[8]  Chuan Yi Tang,et al.  The full Steiner tree problem , 2003, Theor. Comput. Sci..

[9]  Shih-Cheng Yang,et al.  On the Internal Steiner Tree Problem , 2007, TAMC.

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

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

[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]  José Coelho de Pina,et al.  Algorithms for terminal Steiner trees , 2007, Theor. Comput. Sci..

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

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

[16]  Weili Wu,et al.  Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks , 2006, J. Glob. Optim..

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

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

[19]  Philip N. Klein,et al.  Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs , 2009, TALG.

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

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

[22]  Chuan Yi Tang,et al.  On the Full and Bottleneck Full Steiner Tree Problems , 2003, COCOON.

[23]  Thomas Rothvoß,et al.  Matroids and integrality gaps for hypergraphic steiner tree relaxations , 2011, STOC '12.

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

[25]  Stefan Hougardy,et al.  On approximation algorithms for the terminal Steiner tree problem , 2004, Inf. Process. Lett..

[26]  Jochen Könemann,et al.  On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree , 2014, Math. Program..

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

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

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

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

[31]  Bernhard Fuchs.  A note on the terminal Steiner tree problem , 2003, Inf. Process. Lett..

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

[33]  Carlos Eduardo Ferreira,et al.  New Reduction Techniques for the Group Steiner Tree Problem , 2006, SIAM J. Optim..