Article
Another greedy heuristic for the constrained forest problem
Operations Research Letters
Document Type
Article
Publication Date
11-1-2005
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 greedy heuristic for this NP-hard problem, whose solutions are at least as good as, and often better than, those produced by the best-known 2-approximate heuristic.
DOI
10.1016/j.orl.2004.11.010
Disciplines
Citation Information
Michael J Laszlo and Sumitra Mukherjee. "Another greedy heuristic for the constrained forest problem" Operations Research Letters Vol. 33 Iss. 6 (2005) p. 629 - 633 ISSN: 0167-6377 Available at: http://works.bepress.com/michael-laszlo/7/