A distributed approximation algorithm for the minimum degree minimum weight spanning trees

Christian Lavault, Mario Valencia-Pabon

Fischer has shown how to compute a minimum weight spanning tree of degree at most $b{\Delta }^{\ast }+\lceil \log \_bn\rceil$ in time $O(n^{4+1/\ln b})$ for any constant $b>1$, where $Δ^*…