Practical Data-Oriented Microaggregation for Statistical Disclosure Control
IEEE Transactions on Knowledge and Data Engineering
An Efficient k-Means Clustering Algorithm: Analysis and Implementation
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
A class of heuristics for the constrained forest problem
Discrete Applied Mathematics
Covering a Graph with a Constrained Forest (Extended Abstract)
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Communication: A class of heuristics for the constrained forest problem
Discrete Applied Mathematics
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
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.00 |
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.