@InProceedings{feldmann_et_al:LIPIcs.OPODIS.2020.31,
author = {Feldmann, Michael and Hinnenthal, Kristian and Scheideler, Christian},
title = {{Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs}},
booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)},
pages = {31:1--31:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-176-4},
ISSN = {1868-8969},
year = {2021},
volume = {184},
editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.31},
URN = {urn:nbn:de:0030-drops-135165},
doi = {10.4230/LIPIcs.OPODIS.2020.31},
annote = {Keywords: hybrid networks, overlay networks, sparse graphs, cactus graphs}
}