The Community for Technology Leaders
RSS Icon
Subscribe
Los Angeles, CA
March 31, 2009 to April 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
Xueliang Li, Yang Luo, "Weighted Lee Algorithm on Rectilinear Steiner Tree with Obstacles and Boundary", CSIE, 2009, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009, pp. 369-374, doi:10.1109/CSIE.2009.178
401 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool