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

Christian Lavault, Mario Valencia-Pabon
2008 Journal of Parallel and Distributed Computing  
Fischer [3] has shown how to compute a minimum weight spanning tree of degree at most b∆ * + ⌈log b n⌉ in time O(n 4+1/ln b ) for any constant b > 1, where ∆ * is the value of an optimal solution and n is the number of nodes in the network. In this paper, we propose a distributed version of Fischer's algorithm that requires messages and time complexity O(n 2+1/ln b ), and O(n) space per node.
doi:10.1016/j.jpdc.2007.07.005 fatcat:nrzhl3nwoze4hmh2oillzyr5hy