Optimizing the Degree of Minimum Weight Spanning Trees
Author | : Cornell University. Dept. of Computer Science |
Publisher | : |
Total Pages | : 5 |
Release | : 1993 |
Genre | : NP-complete problems |
ISBN | : |
Download Optimizing the Degree of Minimum Weight Spanning Trees Book in PDF, Epub and Kindle
This paper presents two algorithms to construct minimum weight spanning trees with approximately minimum degree. The first method gives a spanning tree whose maximum degree is $O(\delta[superscript]{*} + logn)$ where $\delta[superscript]{*}$ is the minimum possible, and $n$ is the number of vertices. The second method gives a spanning tree of degree no more than $k \cdot (\delta[superscript]{*} + 1)$, where $k$ is the number of distinct weights in the graph. Finding the exact minimum is NP-hard.