Article ID Journal Published Year Pages File Type
8903514 Electronic Notes in Discrete Mathematics 2017 6 Pages PDF
Abstract
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.
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, , , ,