A New Partitioning Algorithm for Solving The RST Problems
碩士 === 國立虎尾科技大學 === 工業工程與管理研究所 === 95 === Rectilinear Steiner tree is an acyclic network constructed by the horizontal and vertical line segment, that span over all the given nodes. RST is an NP-complete problem that consumes tremendous computation time. Due to its complexity on computation, many re...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/tqc695 |