Michael Elkin

Lower-Stretch Spanning Trees

We show that every weighted connected graph

The Locality of Distributed Symmetry Breaking

G

Lower-stretch spanning trees

contains as a subgraph a spanning tree into which the edges of

Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition

G

Efficient algorithms for constructing (1+∊,β)-spanners in the distributed and streaming models

can be embedded with average stretch

Distributed approximation: a survey

O (\log^{2} n \log \log n)

Computing almost shortest paths

. Moreover, we show that this tree can be constructed in time

Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem

O (m \log n + n \log^2 n)

Distributed

in general, and in time

(\Delta+1)

O (m \log n)