The Community for Technology Leaders
Computer Science and Information Engineering, World Congress on (2009)
Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
ISBN: 978-0-7695-3507-4
pp: 369-374
ABSTRACT
This paper presents a new model for VLSI routing in the presence of obstacles and boundary. A new approach for reduction of the routing area is proposed, and a modified Lee algorithm - weighted Lee algorithm is applied on the extended Hanan grid to compute sub-optimal RSMT in $O(n^2(n+m)^2\log(n+m))$ time, where $n$ is the number of terminals, $m$ is the number of vertices of obstacles and boundary.
INDEX TERMS
rectilinear Steiner tree, obstacles, boundary, extended Hanan grid, weighted Lee algorithm
CITATION

X. Li and Y. Luo, "Weighted Lee Algorithm on Rectilinear Steiner Tree with Obstacles and Boundary," 2009 WRI World Congress on Computer Science and Information Engineering, CSIE(CSIE), Los Angeles, CA, 2009, pp. 369-374.
doi:10.1109/CSIE.2009.178
93 ms
(Ver 3.3 (11022016))