A class of heuristics for the constrained forest problem
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.
constrained forest problem greedy heuristics tree partitioning minimum spanning forests