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

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

2006-07-08

arxiv.org/abs/cs/0607031v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

Fischer has shown how to compute a minimum weight spanning tree of degree at most $b \Delta^* + \lceil \log\_b n\rceil$ in time $O(n^{4 + 1/\ln b})$ for any constant $b > 1$, where $\Delta^*$ 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.

Affiliated with

Also associated with

No associations

Rating

A distributed approximation algorithm for the minimum degree minimum weight spanning trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A distributed approximation algorithm for the minimum degree minimum weight spanning trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A distributed approximation algorithm for the minimum degree minimum weight spanning trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-347651