IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v238y2016i1p315-32810.1007-s10479-015-2068-1.html
   My bibliography  Save this article

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

Author

Listed:
  • V. Kirzhner
  • Z. Volkovich
  • E. Ravve
  • G.-W. Weber

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

Suggested Citation

  • V. Kirzhner & Z. Volkovich & E. Ravve & G.-W. Weber, 2016. "An estimate of the objective function optimum for the network Steiner problem," Annals of Operations Research, Springer, vol. 238(1), pages 315-328, March.
    • Handle: RePEc:spr:annopr:v:238:y:2016:i:1:p:315-328:10.1007/s10479-015-2068-1
    DOI: 10.1007/s10479-015-2068-1
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-015-2068-1
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-015-2068-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:238:y:2016:i:1:p:315-328:10.1007/s10479-015-2068-1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.