The Selected-leaf-terminal Steiner Tree Problem and Related Problems
碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 93 === We investigate a practical variant of the well-known graph Steiner tree problem. For a complete graph with length function and two vertex subsets R and R', a selected-leaf-terminal Steiner tree is a Steiner tree which contains all vertices in R such that...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/65358670340530333405 |