A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree bounds Bv > 1 for all vertices v, find a spanning tree T of minimum total edge-cost such that the maximum degree of each node v in T is at most Bv. Our algorithm finds a tree in which the degree of each node v is O(Bv + log n) and the total edge-cost is at most a constant times the cost of any tree that obeys all degreedoi:10.1137/s0097539702418048 fatcat:dqvqv6sywbczpe2mcmm4nyfgsa