24 N. DI MAURO, T.M.A. BASILE, S. FERILLI, AND F. ESPOSITO
14. S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi, **Optimization by simulated annealing**,
Science 220 **(1983), no. 4598, 671–680.**
15. Manuel Laguna and Rafael Mart, **Grasp and path relinking for 2-layer straight line crossing**
minimization, INFORMS Journal on Computing 11 **(1999), 44–52.**
16. Kate S. Larson and Tuomas W. Sandholm, **Anytime coalition structure generation: an average**
case study**, Proceedings of the third annual conference on Autonomous Agents (New York,**
NY, USA), AGENTS '99, ACM, 1999, pp. 40–47.

17. Nissim Matatov, Lior Rokach, and Oded Maimon, **Privacy-preserving data mining: A feature**
set partitioning approach**, Inf. Sci.** 180 **(2010), 2696–2720.**
18. S. C. Milne, Restricted growth functions, rank row matchings of partitions lattices, and qstirling numbers, Advances in Mathemathics 43 **(1982), 173–196.**
19. J. Mockus, E. Eddy, A. Mockus, L. Mockus, and G. V. Reklaitis, **Bayesian heuristic approach**
to discrete and global optimization**, Kluwer Academic Publishers, 1997.**
20. Petri Myllymaki and Henry Tirri, Constructing computationally efficient bayesian models via unsupervised clustering**, Probabilistic Reasoning and Bayesian Belief Networks**
(A.Gammerman, ed.), Alfred Waller Publishers, 1995, pp. 237–248.

21. T. Rahwan and N. R. Jennings, **An improved dynamic programming algorithm for coalition**
structure generation**, Prooceedings of AAMAS08, 2008, pp. 1417–1420.**
22. T. Rahwan, S. D. Ramchurn, N. R. Jennings, and A. Giovannucci, **An anytime algorithm for**
optimal coalition structure generation, Journal of Artificial Intelligence Research 34 **(2009),**
no. 1, 521–567.

23. M. G. C. resende and C.C. Ribeiro, Grasp with path-relinking: Recent advances and applications**, Metaheuristics: Progress as Real Problem Solvers, Springer-Verlag, 2005, pp. 29–63.**
24. Mauricio G.C. Resende, Celso C. Ribeiro, Fred Glover, and Rafael Mart, **Scatter search and**
path-relinking: Fundamentals, advances, and applications**, Handbook of Metaheuristics (Frederick S. Hillier, Michel Gendreau, and Jean-Yves Potvin, eds.), International Series in Operations Research & Management Science, vol. 146, Springer US, 2010, pp. 87–107.**
25. T. Sandholm, K. Larson, M. Andersson, O. Shehory, and F. Tohm´e, **Coalition structure**
generation with worst case guarantees**, Artificial Intelligence** 111 **(1999), no. 1-2, 209–238.**
26. S. Sen and P. S. Dutta, Searching for optimal coalition structures**, Prooceedings of ICMAS00,**
IEEE Computer Society, 2000, pp. 287–292.

27. Alexander Strehl and Joydeep Ghosh, **Cluster ensembles - a knowledge reuse framework for**
combining multiple partitions, Journal of Machine Learning Research 3 **(2003), 583–617.**
28. Vassilios S. Verykios, Elisa Bertino, Igor Nai Fovino, Loredana Parasiliti Provenza, Yucel Saygin, and Yannis Theodoridis, State-of-the-art in privacy preserving data mining**, SIGMOD**
Rec. 33 **(2004), 50–57.**
29. D. Y. Yeh, A dynamic programming approach to the complete set partitioning problem**, BIT**
26 **(1986), no. 4, 467–474.**
(Nicola Di Mauro) Department of Computer Science, LACAM Laboratory, University of Bari "Aldo Moro", Bari, Italy E-mail address: ndm@di.uniba.it
(Teresa M.A. Basile) Department of Computer Science, LACAM Laboratory, University of Bari "Aldo Moro", Bari, Italy E-mail address: basile@di.uniba.it (Stefano Ferilli) Department of Computer Science, LACAM Laboratory, University of Bari "Aldo Moro", Bari, Italy E-mail address: ferilli@di.uniba.it
(Floriana Esposito) Department of Computer Science, LACAM Laboratory, University of Bari "Aldo Moro", Bari, Italy E-mail address: esposito@di.uniba.it