Another greedy heuristic for the constrained forest problem
Operations Research Letters
ISSN or ISBN
The constrained forest problem seeks a minimum-weight spanning forest in an undirected edge-weighted graph such that each tree spans at least a specified number of vertices. We present a greedy heuristic for this NP-hard problem, whose solutions are at least as good as, and often better than, those produced by the best-known 2-approximate heuristic.
Laszlo, Michael J. and Mukherjee, Sumitra, "Another greedy heuristic for the constrained forest problem" (2005). CEC Faculty Articles. 9.