A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Approximation algorithms for minimum tree partition
Discrete Applied Mathematics
A class of heuristics for the constrained forest problem
Discrete Applied Mathematics
Complexity and approximation of the Constrained Forest problem
Theoretical Computer Science
The path partition problem and related problems in bipartite graphs
Operations Research Letters
Another greedy heuristic for the constrained forest problem
Operations Research Letters
A dual-fitting 3/2-approximation algorithm for some minimum-cost graph problems
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |
We want to find a forest of minimal weight such that each component of this forest is of size at least p. In this paper, we improve the best approximation ratio of 2 - 1/|V| for this problem obtained by Goemans and Williamson in 1995 to 3/2 with a greedy algorithm.