Skip to main content
profile image
Selected Works of Michael Laszlo
Article
A class of heuristics for the constrained forest problem
Discrete Applied Mathematics
  • Michael J Laszlo, Nova Southeastern University
  • Sumitra Mukherjee, Nova Southeastern University
Link Find in your library
Document Type
Article
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
Disciplines
Citation Information
Michael J Laszlo and Sumitra Mukherjee. "A class of heuristics for the constrained forest problem" Discrete Applied Mathematics Vol. 154 Iss. 1 (2006) p. 6 - 14 ISSN: 0166-218X
Available at: http://works.bepress.com/michael-laszlo/4/