论文信息 - Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle

Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle

The general rectilinear Steiner tree problem has been proved to be NP-complete. In this paper, we consider a special case in which the points lie on the boundary of a rectilinear rectangle and give an O(n) algorithm to construct a minimum rectilinear Steiner tree for such points.

Pankaj K. Agarwal | Man-tak Shing

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

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

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

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

[5] J. S. Provan. Convexity and the Steiner tree problem , 1988, Networks.

[6] Alfred V. Aho,et al. Rectilinear steiner trees: Efficient special-case algorithms , 1977, Networks.

[7] Der-Tsai Lee,et al. An O(n log n) Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem , 1980 .

[8] Dana S. Richards,et al. A linear-time Steiner tree routing algorithm for terminals on the boundary of a rectangle , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.