Obstacle-Avoiding Rectilinear Steiner Tree with Minimal Diameter
碩士 === 國立臺灣大學 === 電子工程學研究所 === 97 === In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important problem in the physical design stage of VLSI circuits. Although this problem has attracted a...
Main Authors: | Wen-Di Cheng, 鄭文迪 |
---|---|
Other Authors: | 郭斯彥 |
Format: | Others |
Language: | en_US |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/40481740383336368320 |
Similar Items
-
Obstacle-avoiding rectilinear Steiner tree.
Published: (2009) -
Parallel Algorithms for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction
by: Cheng-Yuan Chang, et al. -
Construction of Obstacles-Avoiding Rectilinear Steiner Tree
by: Chih-Wei Liao, et al.
Published: (2009) -
Efficient Algorithms for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction
by: Chih-Hung Lin, et al.
Published: (2008) -
Efficient Obstacle-Avoiding Rectilinear Steiner Tree Construction
by: Chung-Wei Lin, et al.
Published: (2007)