| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 420353 | Discrete Applied Mathematics | 2006 | 9 Pages |
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
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Michael Laszlo, Sumitra Mukherjee,