Performance-Driven Routing-Tree Construction with Obstacle Consideration
碩士 === 國立臺灣大學 === 電子工程學研究所 === 92 === The optimization of Steiner minimal trees (SMT’s) is a very important problem in computer-aided design of VLSI circuits. Given a graph, the classical SMT problem is to construct a tree of the graph with the minimal total wirelength to reduce interconnect capacit...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/b7e82f |