ANNALS OF OPERATIONS RESEARCH, vol.238, pp.315-328, 2016 (Journal Indexed in SCI)
A complete weighted graph, G(X, Gamma, W), is considered. Let (X) over tilde subset of 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 (X) over tilde. The Steiner tree problem consists of constructing the minimum-length Steiner tree in graph G, for a given subset of vertices (X) over tilde 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.