@InProceedings{chan:LIPIcs.ESA.2021.27,
author = {Chan, Timothy M.},
title = {{All-Pairs Shortest Paths for Real-Weighted Undirected Graphs with Small Additive Error}},
booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)},
pages = {27:1--27:9},
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.27},
URN = {urn:nbn:de:0030-drops-146086},
doi = {10.4230/LIPIcs.ESA.2021.27},
annote = {Keywords: Shortest paths, approximation, matrix multiplication}
}