Covering minimum spanning trees of random subgraphs
From MaRDI portal
Publication:3419593
DOI10.1002/rsa.20115zbMath1108.05082MaRDI QIDQ3419593
Jan Vondrák, Michel X. Goemans
Publication date: 7 February 2007
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20115
05C05: Trees
05C80: Random graphs (graph-theoretic aspects)
05B35: Combinatorial aspects of matroids and geometric lattices
Related Items
Set selection under explorable stochastic uncertainty via covering techniques, A tight bound on the collection of edges in MSTs of induced subgraphs, Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas
Cites Work