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

DOI10.1287/OPRE.1050.0214zbMATH Open1165.90363OpenAlexW1984006984MaRDI QIDQ5322145FDOQ5322145

Authors: Kevin R. Hutson, Douglas R. Shier 

Publication date: 18 July 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/28b3a063281bf3cdab3726db6a52ea2d61e40251

Recommendations

• Approximations for the Random Minimal Spanning Tree with Application to Network Provisioning
• Minimal spanning trees in undirected networks with exponentially distributed arc weights
• scientific article; zbMATH DE number 1444281
• On finding a minimum spanning tree in a network with random weights
• scientific article; zbMATH DE number 1594512

Mathematics Subject Classification ID

Stochastic programming (90C15) Stochastic network models in operations research (90B15)

Cited In (9)

• Approximating the statistics of various properties in randomly weighted graphs
• A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
• Minimal spanning trees in undirected networks with exponentially distributed arc weights
• The Min Mean-Weight Cycle in a Random Network
• Continuous approximation formulas for location problems
• OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS
• Title not available (Why is that?)
• Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below
• Approximations for the Random Minimal Spanning Tree with Application to Network Provisioning

This page was built for publication: Bounding Distributions for the Weight of a Minimum Spanning Tree in Stochastic Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5322145)