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

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES

Random Minimal Trees

  • E. N. GILBERT
  • J. SIAM. 13, 376-387. HARARY, E. . Graph Theory…
  • 1965
Highly Influential
4 Excerpts

On the Value of a Random Minimum Spanning Tree Problem

  • E. N. GILBERT
  • Discrete Appl . Math .
  • 1985

Growth Rates of Minimal Spanning Trees of Multivariate Sample

  • J. M. STEELE
  • Stanford Univ., Dept. of Statistics. Research…
  • 1981

An Introduction to Combinatorial

  • J. RIORDAN
  • 1978

Statistical Methods in the Design of Algorithms

  • B. WEIDE
  • Ph.D Thesis, Carnegie-Mellon University.
  • 1978
1 Excerpt

Shortest Connection Networks and Some Generalizations

  • R. C. PRIM
  • Bell Sys. Tech. Jour.
  • 1957

Similar Papers

Loading similar papers…