pdfformat: 

@InProceedings{becker_et_al:LIPIcs:2019:11311, author = {Ruben Becker and Yuval Emek and Mohsen Ghaffari and Christoph Lenzen}, title = {{Distributed Algorithms for Low Stretch Spanning Trees}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {4:14:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771269}, ISSN = {18688969}, year = {2019}, volume = {146}, editor = {Jukka Suomela}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11311}, URN = {urn:nbn:de:0030drops113116}, doi = {10.4230/LIPIcs.DISC.2019.4}, annote = {Keywords: distributed graph algorithms, lowstretch spanning trees, CONGEST model, ball decomposition, star decomposition} }
Keywords:  distributed graph algorithms, lowstretch spanning trees, CONGEST model, ball decomposition, star decomposition  
Seminar:  33rd International Symposium on Distributed Computing (DISC 2019)  
Issue date:  2019  
Date of publication:  2019 