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
A greedy heuristic for a minimum-weight forest problem
Operations Research Letters
Another greedy heuristic for the constrained forest problem
Operations Research Letters
A dual-fitting 3/2-approximation algorithm for some minimum-cost graph problems
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Hi-index | 0.05 |
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.