Sciweavers

Share
PDCAT
2005
Springer

Approximating Spanning Trees with Inner Nodes Cost

10 years 6 months ago
Approximating Spanning Trees with Inner Nodes Cost
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms with approximation factors of 2.35 · ln n and 2Hn, respectively, where n is the number of nodes in the graph and Hn is the n-th Harmonic number. This nearly matches the lower bound of (1 − )Hn, for any > 0. We also give an approximation algorithm with approximation factor ∆ − 1, where ∆ is the maximum degree of the graph. For metric spaces, we give a 3.105-approximation
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where PDCAT
Authors Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Haitao Wang
Comments (0)
books