A class of heuristics for the constrained forest problem

Authors:
Michael Laszlo;Sumitra Mukherjee
Affiliations:
Nova Southeastern University, Graduate School of Computer and Information Sciences, Ft. Lauderdale, FL;Nova Southeastern University, Graduate School of Computer and Information Sciences, Ft. Lauderdale, FL
Venue:
Discrete Applied Mathematics
Year:
2006

Citing 3
Cited 3

LHS-Based Hybrid Microdata vs Rank Swapping and Microaggregation for Numeric Microdata Protection

Inference Control in Statistical Databases, From Theory to Practice
On the complexity of graph tree partition problems

Discrete Applied Mathematics
Another greedy heuristic for the constrained forest problem

Operations Research Letters

Covering a Graph with a Constrained Forest (Extended Abstract)

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Complexity and approximation of the Constrained Forest problem

Theoretical Computer Science
A 3/2 approximation for a constrained forest problem

ESA'11 Proceedings of the 19th European conference on Algorithms

Quantified Score

Hi-index	0.05

Visualization

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.