Provably good algorithms for performance-driven global routing
J. Cong, A. Kahng, et al.
ISCAS 1992
The switchbox rectilinear Steiner tree problem is to construct an optimal rectilinear Steiner tree interconnecting n terminals on the perimeter of a switchbox without crossing any obstacles inside the switchbox. However, intersecting boundaries of obstacles is allowed. We present an algorithm that computes an optimal switchbox rectilinear Steiner tree in O(F(k)n + F(k)) time, where k is the number of obstacles inside the switchbox and F and F are exponential functions of k. For any constant k, the proposed algorithm runs in O(n) time. As an immediate extension, we can generate m Steiner trees in O(mn) time, and among them, select the best one. © 1992 IEEE
J. Cong, A. Kahng, et al.
ISCAS 1992
A. Albrecht, C.K. Wong
Neural Processing Letters
P.C. Yue, C.K. Wong
Journal of the ACM
C.K. Wong, Shi-Kuo Chang
IEEE TC