Sciweavers

Share
IPL
2007

Spanning trees with minimum weighted degrees

8 years 12 months ago
Spanning trees with minimum weighted degrees
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree), the weighted degree of a vertex is defined as the sum of the weights of its incident edges. In this paper, we propose a 4.5-approximation algorithm for this problem. We also prove it is NP-hard to approximate this problem within a 2 − ε factor. © 2007 Elsevier B.V. All rights reserved.
Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Sha
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where IPL
Authors Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Shayan Oveis Gharan, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam
Comments (0)
books