@InProceedings{barth_et_al:LIPIcs.ESA.2022.14,
author = {Barth, Florian and Funke, Stefan and Proissl, Claudius},
title = {{An Upper Bound on the Number of Extreme Shortest Paths in Arbitrary Dimensions}},
booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)},
pages = {14:1--14:12},
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.14},
URN = {urn:nbn:de:0030-drops-169525},
doi = {10.4230/LIPIcs.ESA.2022.14},
annote = {Keywords: Parametric Shortest Paths, Extreme Shortest Paths}
}