A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Distributed Algorithms for Low Stretch Spanning Trees
2019
International Symposium on Distributed Computing
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(log 3 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)
doi:10.4230/lipics.disc.2019.4
dblp:conf/wdag/BeckerEGL19
fatcat:lpbwemj3fvfwfc4vpnbshlyoqi