An estimate of the objective function optimum for the network Steiner problem

V. Kirzhner (), Z. Volkovich (), E. Ravve () and G.-W. Weber ()

Annals of Operations Research, 2016, vol. 238, issue 1, 315-328

Abstract: A complete weighted graph, $$G(X,\varGamma ,W)$$ G ( X , Γ , W ) , is considered. Let $$\tilde{X}\subset X$$ X ~ ⊂ 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}$$ X ~ . The Steiner tree problem consists of constructing the minimum-length Steiner tree in graph G, for a given subset of vertices $$\tilde{X}$$ 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. Copyright Springer Science+Business Media New York 2016

Keywords: Spanning tree; Steiner tree; Steiner problem (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-015-2068-1 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:238:y:2016:i:1:p:315-328:10.1007/s10479-015-2068-1

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-015-2068-1

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().