Another greedy heuristic for the constrained forest problem

Operations Research Letters

Volumn 33, Issue 6, 2005, Pages 629-633

  Laszlo, Michael ^a   Mukherjee, Sumitra ^a  

^a NOVA SOUTHEASTERN UNIVERSITY   (United States)

Author keywords

Constrained forest problem; Greedy heuristics; Minimum spanning forests; Tree partitioning

Indexed keywords

APPROXIMATION THEORY; HEURISTIC METHODS; OPERATIONS RESEARCH; TREES (MATHEMATICS);

CONSTRAINED FOREST PROBLEM; GREEDY HEURISTICS; MINIMUM SPANNING FORESTS; TREE PARTITIONING;

PROBLEM SOLVING;

EID: 24144454606     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.11.010     Document Type: Article

References (6)

1. R. Cordone, and F. Maffioli On the complexity of graph tree partition problems Discrete Appl. Math. 134 2004 51 65
2. R.A. Dandekar, J. Domingo-Ferrer, F. Sebe, LHS-based hybrid microdata vs rank swapping and microaggregation for numeric microdata protection, in: J. Domingo-Ferrer (Ed.), Inference Control in Statistical Databases, Lecture Notes in Computer Science 2316, Springer, 2002.
3. J. Domingo-Ferrer, and J.M. Mateo-Sanz Practical data-oriented microaggregation for statistical disclosure control IEEE Trans. Knowledge and Data Eng. 1 14 2002 189 201
4. C. Imelieńska, B. Kalantari, and L. Khachiyan A greedy heuristic for a minimum weight forest problem Oper. Res. Lett. 14 1993 65 71
5. T. Kanungo, D.M. Mount, N. Netanyahu, C. Piatko, R. Silverman, and A.Y. Wu An efficient k-means clustering algorithm analysis and implementation IEEE Trans. PAMI 24 7 2002 881 892
6. M. Laszlo, S. Mukherjee, Minimum spanning tree partitioning algorithms for microaggregation, Working Paper, Graduate School of Computer and Information Sciences, Nova Southeastern University.