Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
428273 | Information Processing Letters | 2007 | 4 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics