On the random 2-stage minimum spanning tree
From MaRDI portal
Publication:3376662
DOI10.1002/rsa.20079zbMath1089.60010WikidataQ57401503 ScholiaQ57401503MaRDI QIDQ3376662
Abraham D. Flaxman, Michael Krivelevich, Alan M. Frieze
Publication date: 24 March 2006
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20079
05C80: Random graphs (graph-theoretic aspects)
90C15: Stochastic programming
60C05: Combinatorial probability
91B32: Resource and cost allocation (including fair division, apportionment, etc.)
Related Items
On greedy approximation algorithms for a class of two-stage stochastic assignment problems, Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms, On the approximability of robust spanning tree problems, The submodularity of two-stage stochastic maximum-weight independent set problems, Typical values of extremal-weight combinatorial structures with independent symmetric weights, Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty, Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation, Two-stage combinatorial optimization problems under risk
Cites Work
