On the random 2-stage minimum spanning tree

MaRDI QIDQ2921759zbMATH OpenFDO

Authors Abraham D. Flaxman, Michael Krivelevich, Alan Frieze

Publication date 13 October 2014

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Recommendations

• On the random 2-stage minimum spanning tree
• On Two-Stage Stochastic Minimum Spanning Trees
• On random minimum length spanning trees
• On the length of a random minimum spanning tree
• On the value of a random minimum spanning tree problem
• A note on random minimum length spanning trees
• Stochastic minimum spanning trees and related problems
• scientific article; zbMATH DE number 1984546
• Random minimum length spanning trees in regular graphs
• On the probabilistic min spanning tree problem

Cited in

(8)

• On the 2-MRS problem in a tree with unreliable edges
• Online stochastic optimization under time constraints
• Two-stage stochastic max-weight independent set problems
• Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
• On the random 2-stage minimum spanning tree
• On Two-Stage Stochastic Minimum Spanning Trees
• Online purchasing under uncertainty
• Commitment under uncertainty: Two-stage stochastic matching problems

This page was built for publication: On the random 2-stage minimum spanning tree

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