A class of heuristics for the constrained forest problem

Author(s)

Michael J. Laszlo, Nova Southeastern UniversityFollow
Sumitra Mukherjee, Nova Southeastern UniversityFollow

Document Type

Article

Publication Title

Discrete Applied Mathematics

ISSN

0166-218X

Publication Date

1-1-2006

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.

DOI

10.1016/j.dam.2005.06.006

Volume

154

Issue

1

First Page

6

Last Page

14

NSUWorks Citation

Laszlo, Michael J. and Mukherjee, Sumitra, "A class of heuristics for the constrained forest problem" (2006). CCE Faculty Articles. 7.
https://nsuworks.nova.edu/gscis_facarticles/7