A class of heuristics for the constrained forest problem

Discrete Applied Mathematics

Volumn 154, Issue 1, 2006, Pages 6-14

  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

GRAPH THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

CONSTRAINED FOREST PROBLEM; GREEDY HEURISTICS; MINIMUM SPINNING FOREST; TREE PARTITIONING;

HEURISTIC METHODS;

EID: 27744518151     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.06.006     Document Type: Article

References (4)

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, vol. 2316, Springer, Berlin, 2002.
3. C. Imelieńska, B. Kalantari, and L. Khachiyan A greedy heuristic for a minimum weight forest problem Oper. Res. Lett. 14 1993 65 71
4. M. Laszlo, S. Mukherjee, Another greedy heuristic for the constrained forest problem, Oper. Res. Lett. 33(6) (2005), in press, 10.1016/j.orl.2004.11. 010.