DECENTRALIZED LOW-STRETCH TREES VIA LOW DIAMETER GRAPH DECOMPOSITIONS

We study the problem of approximating the distances in an undirected weighted graph G by the distances in trees based on the notion of stretch. Focusing on decentralized models of computation such as the \sansC\sansO\sansN\sansG\sansE\sansS\sansT, \sansP\sansR\sansA\sansM, and semi-streaming models, our main results are as follows: (1) We develop a simple randomized algorithm that constructs a spanning tree such that the expected stretch of every edge is O(log³ n), where n is the number of nodes in G. If G is unweighted, then this algorithm can be implemented to run in O(hop(G)) rounds in the \sansC\sansO\sansN\sansG\sansE\sansS\sansT model, where hop(G) is the hop-diameter of G; thus our algorithm is asymptotically optimal in this case. In the weighted case, the run-time of the algorithm matches the currently best known bound for exact single source shortest path (SSSP) computations, which despite recent progress is still separated from the lower bound of \Omega(\surdn + hop(G)) by polynomial factors. A naive attempt to replace exact SSSP computations with approximate ones in order to improve the complexity in the weighted case encounters a fundamental challenge, as the underlying decomposition technique fails to work under distance approximation. (2) We overcome this obstacle by developing a technique termed blurry ball growing. This technique, in combination with a clever algorithmic idea of Miller, Peng, and Xu (SPAA 2013), allows us to obtain low diameter graph decompositions with small edge cutting probabilities based solely on approximate SSSP computations. (3) Using these decompositions, we in turn obtain metric tree embedding algorithms in the vein of the celebrated work of Bartal (FOCS 1996), whose computational complexity is optimal up to polylogarithmic factors not only in the \sansC\sansO\sansN\sansG\sansE\sansS\sansT model but also in the \sansP\sansR\sansA\sansM and semi-streaming models. Our embeddings have the additional useful property that the tree can be mapped back to the original graph such that each edge is ``used"" only logarithmically many times. This property is of interest for capacitated problems and for simulating \sansC\sansO\sansN\sansG\sansE\sansS\sansT algorithms on the tree into which the graph is embedded.