@InProceedings{erlebach_et_al:LIPIcs.ESA.2022.49,
author = {Erlebach, Thomas and de Lima, Murilo Santos and Megow, Nicole and Schl\"{o}ter, Jens},
title = {{Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty}},
booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)},
pages = {49:1--49:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-247-1},
ISSN = {1868-8969},
year = {2022},
volume = {244},
editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.49},
URN = {urn:nbn:de:0030-drops-169872},
doi = {10.4230/LIPIcs.ESA.2022.49},
annote = {Keywords: explorable uncertainty, queries, untrusted predictions}
}