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

Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where is the maximum degree value of an optimal solution and n is the number of nodes in the network. In the present paper, we propose a distributed version of Fischer's sequential algorithm with time complexity O n2+1/ln b , requiring O n3+1/ln b messages and O(n) space per node, where is the maximum degree of the initial minimum weight spanning tree.

• Type: Journal
• Year: 2006
• Where: CORR
• Authors: Christian Lavault, Mario Valencia-Pabon
• Keywords: CORR 2006, Education, Maximum Degree, Minimum Weight, Sequential Algorithm