论文信息 - on Component-size Bounded Steiner Trees

on Component-size Bounded Steiner Trees

A Steiner tree is a tree interconnecting a given set of points in a metric space such that all leaves are given points. A (full) component of a Steiner tree is a subtree which results from splitting the Steiner tree at some given points. A k-size Steiner tree is a Steiner tree in which every component has at most k given points. The k-Steiner ratio is the largest lower bound for the ratio between lengths of a minimum Steiner tree and a minimum k-size Steiner tree for the same set of points. In this paper, we determine the 3-Steiner ratio in weighted graphs.

Ding-Zhu Du

[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[3] J. Hyam Rubinstein,et al. The Steiner ratio conjecture for six points , 1991, J. Comb. Theory A.

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

[5] R. Graham,et al. The steiner problem in phylogeny is NP-complete , 1982 .

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

[7] Ding-Zhu Du,et al. An approach for proving lower bounds: solution of Gilbert-Pollak's conjecture on Steiner ratio , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[8] David S. Johnson,et al. The Complexity of Computing Steiner Minimal Trees , 1977 .

[9] Q. Feng,et al. On better heuristic for Euclidean Steiner minimum trees , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[10] H. Pollak,et al. Steiner Minimal Trees , 1968 .

[11] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .

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