IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v146y2006i1p3-1810.1007-s10479-006-0043-6.html
   My bibliography  Save this article

Minimum spanning trees in networks with varying edge weights

Author

Listed:
  • Kevin Hutson
  • Douglas Shier

Abstract

This paper considers the problem of determining minimum spanning trees in networks in which each edge weight can assume a finite number of distinct values. We use the algebraic structure of an underlying Hasse diagram to describe the relationship between different edge-weight realizations of the network, yielding new results on how MSTs change under multiple edge-weight perturbations. We investigate various implementation strategies for updating MSTs in this manner. Computational results are provided for some challenging test networks. Copyright Springer Science+Business Media, LLC 2006

Suggested Citation

  • Kevin Hutson & Douglas Shier, 2006. "Minimum spanning trees in networks with varying edge weights," Annals of Operations Research, Springer, vol. 146(1), pages 3-18, September.
    • Handle: RePEc:spr:annopr:v:146:y:2006:i:1:p:3-18:10.1007/s10479-006-0043-6
    DOI: 10.1007/s10479-006-0043-6
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-0043-6
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-006-0043-6?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.

    References listed on IDEAS

    as
    1. Anjani Jain & John W. Mamer, 1988. "Approximations for the Random Minimal Spanning Tree with Application to Network Provisioning," Operations Research, INFORMS, vol. 36(4), pages 575-584, August.
    2. James P. Jarvis & Douglas R. Shier, 1996. "An Improved Algorithm for Approximating the Performance of Stochastic Flow Networks," INFORMS Journal on Computing, INFORMS, vol. 8(4), pages 355-360, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zeinab Shariat & Ali Movaghar & Mehdi Hoseinzadeh, 2017. "A learning automata and clustering-based routing protocol for named data networking," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 65(1), pages 9-29, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kevin R. Hutson & Douglas R. Shier, 2005. "Bounding Distributions for the Weight of a Minimum Spanning Tree in Stochastic Networks," Operations Research, INFORMS, vol. 53(5), pages 879-886, October.

    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:146:y:2006:i:1:p:3-18:10.1007/s10479-006-0043-6. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.