pdfformat: 

@InProceedings{chan:LIPIcs.ESA.2021.27, author = {Chan, Timothy M.}, title = {{AllPairs Shortest Paths for RealWeighted Undirected Graphs with Small Additive Error}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {27:127:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772044}, ISSN = {18688969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14608}, URN = {urn:nbn:de:0030drops146086}, doi = {10.4230/LIPIcs.ESA.2021.27}, annote = {Keywords: Shortest paths, approximation, matrix multiplication} }
Keywords:  Shortest paths, approximation, matrix multiplication  
Seminar:  29th Annual European Symposium on Algorithms (ESA 2021)  
Issue date:  2021  
Date of publication:  31.08.2021 