@InProceedings{becker_et_al:LIPIcs.ITCS.2020.50,
author = {Becker, Ruben and Emek, Yuval and Lenzen, Christoph},
title = {{Low Diameter Graph Decompositions by Approximate Distance Computation}},
booktitle = {11th Innovations in Theoretical Computer Science Conference (ITCS 2020)},
pages = {50:1--50:29},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-134-4},
ISSN = {1868-8969},
year = {2020},
volume = {151},
editor = {Vidick, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.50},
URN = {urn:nbn:de:0030-drops-117355},
doi = {10.4230/LIPIcs.ITCS.2020.50},
annote = {Keywords: graph decompositions, metric tree embeddings, distributed graph algorithms, parallel graph algorithms, (semi-)streaming graph algorithms}
}