@inproceedings{0dc61ca577a54701afd8a0a8998ed614,
title = "Distributed algorithms for low stretch spanning trees",
abstract = "Given an undirected graph with integer edge lengths, we study the problem of approximating the distances in the graph by a spanning tree based on the notion of stretch. Our main contribution is a distributed algorithm in the CONGEST model of computation that constructs a random spanning tree with the guarantee that the expected stretch of every edge is O(log3 n), where n is the number of nodes in the graph. If the graph is unweighted, then this algorithm can be implemented to run in O(D) rounds, where D is the hop-diameter of the graph, thus being asymptotically optimal. In the weighted case, the run-time of our algorithm matches the currently best known bound for exact distance computations, i.e., {\~O}(min{√nD, √nD1/4 + n3/5 + D}). We stress that this is the first distributed construction of spanning trees leading to poly-logarithmic expected stretch with non-trivial running time.",
keywords = "Ball decomposition, CONGEST model, Distributed graph algorithms, Low-stretch spanning trees, Star decomposition",
author = "Ruben Becker and Yuval Emek and Mohsen Ghaffari and Christoph Lenzen",
note = "Publisher Copyright: {\textcopyright} Ruben Becker, Yuval Emek, Mohsen Ghaffari, and Christoph Lenzen.; 33rd International Symposium on Distributed Computing, DISC 2019 ; Conference date: 14-10-2019 Through 18-10-2019",
year = "2019",
month = oct,
doi = "10.4230/LIPIcs.DISC.2019.4",
language = "الإنجليزيّة",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
editor = "Jukka Suomela",
booktitle = "33rd International Symposium on Distributed Computing, DISC 2019",
}