Parallel Algorithms for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction
碩士 === 元智大學 === 資訊工程學系 === 100 === In the field of integrated circuit physical design automation, the problem of obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is a fundamental problem and has attracted a lot of research attention. In this thesis, three parallel algorithms...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Online Access: | http://ndltd.ncl.edu.tw/handle/70484244380143531633 |