کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
8903514 1632569 2017 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A 3-approximation algorithm for the maximum leaf k-forest problem
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
A 3-approximation algorithm for the maximum leaf k-forest problem
چکیده انگلیسی
In the maximum leaf spanning tree problem, we want to find a tree which spans every vertex of a graph and has as many leaves as possible. The maximum leaf k-forest problem is a generalization of that problem, in which we want a spanning forest with maximum number of leaves and no more than k components. We give a 3-approximation algorithm for this problem.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Discrete Mathematics - Volume 62, November 2017, Pages 201-206
نویسندگان
, , , ,