@InProceedings{bilo_et_al:LIPIcs.STACS.2022.12,
author = {Bil\`{o}, Davide and D'Angelo, Gianlorenzo and Gual\`{a}, Luciano and Leucci, Stefano and Proietti, Guido and Rossi, Mirko},
title = {{Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers}},
booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)},
pages = {12:1--12:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-222-8},
ISSN = {1868-8969},
year = {2022},
volume = {219},
editor = {Berenbrink, Petra and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.12},
URN = {urn:nbn:de:0030-drops-158221},
doi = {10.4230/LIPIcs.STACS.2022.12},
annote = {Keywords: multipath spanners, graph sparsification, edge-disjoint paths, min-cost flow}
}