Minimum spanning trees in networks with varying edge weights
From MaRDI portal
Publication:863566
DOI10.1007/s10479-006-0043-6zbMath1106.90070OpenAlexW2167817347MaRDI QIDQ863566
Kevin R. Hutson, Douglas R. Shier
Publication date: 5 February 2007
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-006-0043-6
Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15) Deterministic network models in operations research (90B10)
Related Items (3)
Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata ⋮ Euclidean minimum spanning trees with independent and dependent geometric uncertainties ⋮ Finding minimum weight connected dominating set in stochastic graph based on learning automata
Cites Work
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- A flexible algorithm for generating all the spanning trees in undirected graphs
- A note on Arc tolerances in sparse shortest-path and network flow problems
- Shortest paths in networks with exponentially distributed arc lengths
- Approximations for the Random Minimal Spanning Tree with Application to Network Provisioning
- Arc tolerances in shortest path and network flow problems
- Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
- Two Algorithms for Generating Weighted Spanning Trees in Order
- Solving a Class of Stochastic Minimization Problems
- State space partitioning methods for stochastic shortest path problems
- An Improved Algorithm for Approximating the Performance of Stochastic Flow Networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Minimum spanning trees in networks with varying edge weights
