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

DOI10.1287/opre.36.4.575zbMath0652.90098OpenAlexW2105077362MaRDI QIDQ3798496

Anjani Jain, John W. Mamer

Publication date: 1988

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

Full work available at URL: https://repository.upenn.edu/oid_papers/99

zbMATH Keywords

distributionasymptotic propertiesboundsapproximationsmeanundirected graphlength of a minimal spanning treenetwork provisioning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15)

Related Items (1)

Minimum spanning trees in networks with varying edge weights

This page was built for publication: Approximations for the Random Minimal Spanning Tree with Application to Network Provisioning