The Steiner problem in networks : heuristic methods
碩士 === 國立臺灣大學 === 電機工程學系研究所 === 86 === The problems of determining a minimum cost connected subnetwork that spans a given subset of vertices is known as the Steiner problem in networks. Since the Steiner problem in networks is NP-complete, it is pract...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1998
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/81930945988089688105 |