论文信息 - A $\frac{3}{2}$ Approximation for a Constrained Forest Problem

A $\frac{3}{2}$ Approximation for a Constrained Forest Problem

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.

Basile Couëtoux

[1] Leonid Khachiyan,et al. A greedy heuristic for a minimum-weight forest problem , 1993, Oper. Res. Lett..

[2] Michael J. Laszlo,et al. Another greedy heuristic for the constrained forest problem , 2005, Oper. Res. Lett..

[3] Jérôme Monnot,et al. The path partition problem and related problems in bipartite graphs , 2007, Oper. Res. Lett..

[4] Zsolt Tuza,et al. Complexity and approximation of the Constrained Forest problem , 2011, Theor. Comput. Sci..

[5] Michael J. Laszlo,et al. A class of heuristics for the constrained forest problem , 2006, Discret. Appl. Math..

[6] Refael Hassin,et al. Approximation Algorithms for Minimum Tree Partition , 1998, Discret. Appl. Math..

[7] David P. Williamson,et al. A general approximation technique for constrained forest problems , 1992, SODA '92.