论文信息 - The Number of Tree Stars Is O*(1.357k)

The Number of Tree Stars Is O*(1.357k)

Abstract Every rectilinear Steiner tree problem admits an optimal tree T* which is composed of tree stars. Moreover, the currently fastest algorithms for the rectilinear Steiner tree problem proceed by composing an optimum tree T* from tree star components in the cheapest way. The efficiency of such algorithms depends heavily on the number of tree stars (candidate components). Fößmeier and Kaufmann (Algorithmica 26, 68–99, 2000) showed that any problem instance with k terminals has a number of tree stars in between 1.32k and 1.38k (modulo polynomial factors) in the worst case. We determine the exact bound O*(ρk) where ρ≈1.357 and mention some consequences of this result.

Xinhui Wang | Bernhard Fuchs | Walter Kern

[1] Michael Kaufmann,et al. Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem , 1993, ISAAC.

[2] Martin Zachariasen. Rectilinear full Steiner tree generation , 1999 .

[3] Xinhui Wang,et al. Dynamic Programming for Minimum Steiner Trees , 2007, Theory of Computing Systems.

[4] Colin W. B. Campbell. To a day , 2005, Molecular and Cellular Biochemistry.

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

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

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

[8] Martin Zachariasen. The Rectilinear Steiner Tree Problem: A Tutorial , 2001 .

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

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

[11] Jeffrey S. Salowe,et al. An exact rectilinear Steiner tree algorithm , 1993, Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93.

[12] Jeffrey S. Salowe,et al. Thirty-five-point rectilinear steiner minimal trees in a day , 1995, Networks.