论文信息 - A new scheme for the Steiner problem in graphs

A new scheme for the Steiner problem in graphs

The Steiner problem in graphs has found important application in global and detailed routeing of integrated circuit layout. A scheme is described which does not immediately construct a tree, but first obtains an initial tree, and then concentrates on refining it. A loop method for refining is presented, and an algorithm is developed. The algorithm is of low time and space complexity, and experimental results show that it performs well.<<ETX>>

Y.-B. Ji | M.-L. Liu

[1] S. Louis Hakimi,et al. Steiner's problem in graphs and its implications , 1971, Networks.

[2] Pawel Winter,et al. Steiner problem in networks: A survey , 1987, Networks.

[3] F. Hwang,et al. An o(nlogn) algorithm for suboptimal rectilinear steiner trees , 1979 .

[4] J. S. Lee,et al. Use of steiner's problem in suboptimal routing in rectilinear metric , 1976 .

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

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

[7] Peter B. Gibbons,et al. An algorithm for the steiner problem in graphs , 1982, Networks.

[8] Yash P. Aneja,et al. An integer linear programming approach to the steiner problem in graphs , 1980, Networks.

[9] O. Wing,et al. Suboptimal algorithm for a wire routing problem , 1972 .

[10] M. Hanan,et al. On Steiner’s Problem with Rectilinear Distance , 1966 .