@InProceedings{janson_et_al:LIPIcs.APPROX-RANDOM.2019.60,
author = {Janson, Svante and Sorkin, Gregory B.},
title = {{Successive Minimum Spanning Trees}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {60:1--60:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2019.60},
URN = {urn:nbn:de:0030-drops-112759},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.60},
annote = {Keywords: miminum spanning tree, second-cheapest structure, inhomogeneous random graph, optimization in random structures, discrete probability, multi-type branching process, functional fixed point, robust optimization, Kruskal’s algorithm}
}