کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
428273 686627 2007 4 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Spanning trees with minimum weighted degrees
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Processing Letters - Volume 104, Issue 3, 31 October 2007, Pages 113-116