IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v53y2005i5p879-886.html
   My bibliography  Save this article

Bounding Distributions for the Weight of a Minimum Spanning Tree in Stochastic Networks

Author

Listed:
  • Kevin R. Hutson

    (Department of Mathematics and Computer Science, Denison University, Granville, Ohio 43023)

  • Douglas R. Shier

    (Department of Mathematical Sciences, Clemson University, Clemson, South Carolina 29634)

Abstract

This paper considers the problem of determining the distribution of the weight W of a minimum spanning tree for an undirected graph with edge weights that are independently distributed discrete random variables. Using the underlying fundamental cutsets and cycles associated with a spanning tree, we are able to obtain upper and lower bounds on the distribution of W . In turn, these are used to establish bounds on E[W] . Our general method for deriving these bounding distributions subsumes existing approximation methods in the literature. Computational results indicate that the new approximation methods provide excellent bounds for some challenging test networks.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:oropre:v:53:y:2005:i:5:p:879-886
    DOI: 10.1287/opre.1050.0214
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1050.0214
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1050.0214?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
    ---><---

    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.
    Full references (including those not matched with items on IDEAS)

    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 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.

    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:inm:oropre:v:53:y:2005:i:5:p:879-886. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.