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: | , , , |
|---|---|
| Format: | Article |
| Published: |
Springer New York LLC
2016
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/73854/ http://eprints.utm.my/73854/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|