Back to Search
Start Over
An estimate of the objective function optimum for the network Steiner problem.
- Source :
-
Annals of Operations Research . Mar2016, Vol. 238 Issue 1/2, p315-328. 14p. - Publication Year :
- 2016
-
Abstract
- A complete weighted graph, $$G(X,\varGamma ,W)$$ , is considered. Let $$\tilde{X}\subset X$$ 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 $$\tilde{X}$$ . The Steiner tree problem consists of constructing the minimum-length Steiner tree in graph G, for a given subset of vertices $$\tilde{X}$$ The effectively computable estimate of the minimal Steiner tree is obtained in terms of the mean value and the variance over the set of all Steiner trees. It is shown that in the space of the lengths of the graph edges, there exist some regions where the obtained estimate is better than the minimal spanning tree-based one. [ABSTRACT FROM AUTHOR]
- Subjects :
- *SPANNING trees
*STEINER systems
*ESTIMATES
*SET theory
*TREE graphs
*GRAPH theory
Subjects
Details
- Language :
- English
- ISSN :
- 02545330
- Volume :
- 238
- Issue :
- 1/2
- Database :
- Academic Search Index
- Journal :
- Annals of Operations Research
- Publication Type :
- Academic Journal
- Accession number :
- 113272573
- Full Text :
- https://doi.org/10.1007/s10479-015-2068-1