Characterization of line width variation
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000
The channel rectilinear Steiner tree problem is to construct an optimal rectilinear Steiner tree interconnecting n terminals on the upper shore and the lower shore of a channel without crossing any obstacles inside the channel. However, intersecting boundaries of obstacles is allowed. We present an algorithm that computes an optimal channel rectilinear Steiner tree in O(F1(k)n + F2(k)) time, where k is the number of obstacles inside the channel and F1 and F2 are exponential functions of k. For any constant k the proposed algorithm runs in O(n) time. Copyright © 1991 John Wiley & Sons, Ltd.
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000
Shu Tezuka
WSC 1991
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
Martin C. Gutzwiller
Physica D: Nonlinear Phenomena