On Approximation Algorithms for the Terminal Steiner Tree Problem [1 citations — 0 self]
Download:
|
|
by Doratha E. Drake, Stefan Hougardy
http://www.informatik.hu-berlin.de/~hougardy/paper/TerminalSteiner.ps
Add To MetaCart
Abstract:
revised version Abstract. The terminal Steiner tree problem is a special version of the Steiner tree problem, where a Steiner minimum tree has to be found in which all terminals are leaves. We prove that no polynomial time approximation algorithm for the terminal Steiner tree problem can achieve an approximation ratio less than (1 o(1)) ln n unless NP has slightly superpolynomial time algorithms. Moreover, we present a polynomial time approximation algorithm for the metric version of this problem with a performance ratio of 2#, where # denotes the best known approximation ratio for the Steiner tree problem. This improves the previously best known
Citations
| 360 | A threshold of ln n for approximating set cover – Feige - 1998 |
| 264 | Steiner tree problems – Hwang, Richards - 1992 |
| 121 | Improved steiner tree approximation in graphs – ROBINS, ZELIKOVSKY |
| 69 | A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem – Garg, Konjevod, et al. |
| 39 | The Steiner problem with edge lengths 1 – Bern, Plassmann - 1989 |
| 10 | Approximation algorithms for the Steiner tree problem in graphs – Gröpl, Hougardy, et al. - 2001 |
| 8 | Approximation hardness of the steiner tree problem on graphs – Chlebík, Chlebíková - 2002 |
| 2 | Proof verification and hardness of approximation problems, 33rd FOCS – Arora, Lund, et al. - 1992 |
| 2 | On the Full and Bottleneck Full Steiner Tree Problems – Chen, Lu, et al. - 2003 |
| 1 | Chleb kov a, Approximation Hardness of the Steiner Tree Problem on Graphs – k, J |
| 1 | Pr omel, Approximation algorithms for the Steiner tree problem in graphs – opl, Hougardy, et al. |
| 1 | On the Terminal Steiner Tree – Lin, Xue |
