论文信息 - Dynamic Programming for Minimum Steiner Trees

Dynamic Programming for Minimum Steiner Trees

We present a new dynamic programming algorithm that solves the minimum Steiner tree problem on graphs with k terminals in time O*(ck) for any c > 2. This improves the running time of the previously fastest parameterized algorithm by Dreyfus-Wagner of order O*(3k) and the so-called "full set dynamic programming" algorithm solving rectilinear instances in time O*(2.38k).

[1] S. E. Dreyfus,et al. The steiner problem in graphs , 1971, Networks.

[2] Joseph L. Ganley,et al. Optimal Rectilinear Steiner Minimal Trees in O (n22.62n) Time , 1994, CCCG.

[3] David S. Johnson,et al. The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[4] F. Hwang. On Steiner Minimal Trees with Rectilinear Distance , 1976 .

[5] David M. Warme,et al. Exact Algorithms for Plane Steiner Tree Problems: A Computational Study , 2000 .

[6] Stefan Richter,et al. A Faster Algorithm for the Steiner Tree Problem , 2006, STACS.

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

[8] Michael Kaufmann,et al. On Exact Solutions for the Rectilinear Steiner Tree Problem Part I: Theoretical Results , 2000, Algorithmica.

[9] Michael Kaufmann,et al. On exact solutions for the rectilinear Steiner tree problem , 1997, SCG '97.