Title of article
A class of heuristics for the constrained forest problem Original Research Article
Author/Authors
Michael Laszlo، نويسنده , , Sumitra Mukherjee، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
9
From page
6
To page
14
Abstract
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.
Keywords
Greedy heuristics , Minimum spanning forests , Tree partitioning , Constrained forest problem
Journal title
Discrete Applied Mathematics
Serial Year
2006
Journal title
Discrete Applied Mathematics
Record number
886176
Link To Document