论文信息 - Algorithms for Terminal Steiner Trees

Algorithms for Terminal Steiner Trees

The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ – ρ/(3ρ–2) approximation algorithm for the TST, where ρ is the approximation factor of a given algorithm for the Steiner tree problem. Considering the current best value of ρ, this improves a previous 3.10 factor to 2.52. For the TST restricted to instances where all edge costs are either 1 or 2, we improve the approximation factor from 1.60 to 1.42.

José Coelho de Pina | José Soares | Fábio Viduani Martinez

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

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

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

[4] Alexander Schrijver,et al. On the Size of Systems of Sets Every t of Which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems , 1989, SIAM J. Discret. Math..

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

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

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

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

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