This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
Weighted Lee Algorithm on Rectilinear Steiner Tree with Obstacles and Boundary
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
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, vol. 3, pp.369-374, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.