Implementation of the Fastest Rectilinear Steiner Tree Connection Based on the H-tree
碩士 === 國立臺北大學 === 電機工程學系 === 104 === Steiner’s problem in the Euclidean space is one of the most famous combinatorial geometrical problems. In fact, Garey et. al. have proved that the solution of Steiner’s Problem is at least as difficult as any of the so-called NP-complete problem. In this article,...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/61694792211105101132 |