An estimate of the objective function optimum for the network Steiner problem
A complete weighted graph, (Formula presented.) , is considered. Let (Formula presented.) be some subset of vertices and, by definition, a Steiner tree is any tree in the graph G such that the set of the tree vertices includes set (Formula presented.). The Steiner tree problem consists of constructi...
Saved in:
| Main Authors: | , , , |
|---|---|
| 格式: | Article |
| 出版: |
Springer New York LLC
2016
|
| 主題: | |
| 在線閱讀: | http://eprints.utm.my/id/eprint/73854/ https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959108161&doi=10.1007%2fs10479-015-2068-1&partnerID=40&md5=e15420d1d346c3031b1525940dd891a0 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
成為第一個發表評論!