The Selected-Internal Steiner Tree Problem
碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 93 === In this paper, we consider an interesting variant of the well-known Steiner tree problem: Given a complete graph G = (V,E) with a cost function c:E->R+ and two subsets R and R' satisfying R' contained in R and R contained in or equal to V, a sele...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/36151830867048915841 |