Given n points in the Euclidean plane, the degree-- MST problem asks for a spanning tree of minimum weight in which the degree of each node is at most 

Balaji Raghavachari

Raja Jothi

Given n points in the Euclidean plane, the degree- minimum spanning tree problem  asks for a spanning tree of minimum weight in which the degree of each vertex is at  most . The problem is NP-hard for 2    3, while the NP-hardness of the problem  is open for  = 4. The problem is polynomial-time solvable when  = 5. By presenting  an improved approximation analysis for Chan&apos;s degree-4 MST algorithm [4], we show  that, for any arbitrary collection of points in the Euclidean plane, there always exists    2 + 2)=3 to be exact, times the  weight of an MST

CiteSeerX

Degree-Bounded Minimum Spanning Trees

http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.6931

Degree-Bounded Minimum Spanning Trees

Abstract

Similar works

Full text

Available Versions

CiteSeerX