A class of heuristics for the constrained forest problem
Discrete Applied Mathematics
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 structured class of greedy heuristics for this NP-hard problem, and identify the best heuristic.
Laszlo, Michael J. and Mukherjee, Sumitra, "A class of heuristics for the constrained forest problem" (2006). CEC Faculty Articles. 7.