A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model

Maleq Khan, V. S. Anil Kumar, Gopal Pandurangan +1

A fundamental problem in wireless networks is the \emph{minimum spanning tree} (MST) problem: given a set $V$ of wireless nodes, compute a spanning tree $T$, so that the total cost…