Highly Influenced

# Approximations for the Random Minimal Spanning Tree with Application to Network Provisioning

@article{Jain1988ApproximationsFT, title={Approximations for the Random Minimal Spanning Tree with Application to Network Provisioning}, author={Anjani Jain and John W. Mamer}, journal={Operations Research}, year={1988}, volume={36}, pages={575-584} }

- Published in Operations Research 1988
DOI:10.1287/opre.36.4.575

This paper considers the problem of determining the mean and distribution of the length of a minimal spanning tree (MST) on an undirected graph whose arc lengths are independently distributed random variables. We obtain bounds and approximations for the MST length and show that our upper bound is much tighter than the naive bound obtained by computing the MST length of the deterministic graph with the respective means as arc lengths. We analyze the asymptotic properties of our approximations… CONTINUE READING