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.
| Original language | American English |
|---|---|
| Pages (from-to) | 6-14 |
| Number of pages | 9 |
| Journal | Discrete Applied Mathematics |
| Volume | 154 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 1 2006 |
ASJC Scopus Subject Areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics
Keywords
- Constrained forest problem
- Tree partitioning
- Minimum spanning forests
- Greedy heuristics
Disciplines
- Computer Sciences
Fingerprint
Dive into the research topics of 'A class of heuristics for the constrained forest problem'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS