@InProceedings{akav_et_al:LIPIcs.ESA.2021.4,
author = {Akav, Maor and Roditty, Liam},
title = {{A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs}},
booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)},
pages = {4:1--4:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-204-4},
ISSN = {1868-8969},
year = {2021},
volume = {204},
editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.4},
URN = {urn:nbn:de:0030-drops-145858},
doi = {10.4230/LIPIcs.ESA.2021.4},
annote = {Keywords: Graph algorithms, Approximate All Pairs of Shortest Paths, Distance Oracles}
}