Reactive and dynamic local search for max-clique: Engineering effective building blocks

This paper presents the results of an ongoing investigation about how different algorithmic building blocks contribute to solving the maximum clique problem. We consider greedy constructions, plateau searches, and more complex schemes based on dynamic penalties and/or prohibitions, in particular the recently proposed technique of dynamic local search and the previously proposed reactive local search (RLS). We design a variation of the original RLS algorithm where the role of long-term memory (LTM) is increased (RLS-LTM). In addition, we consider in detail the effect of the low-level implementation choices on the CPU time per iteration. We present experimental results on randomly generated graphs with different statistical properties, showing the crucial effects of the implementation, the robustness of different techniques, and their empirical scalability.

[1]  J. Håstad.  Clique is hard to approximate within n 1-C , 1996 .

[2]  Johan Håstad,et al.  Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[3]  Xing Xu,et al.  A graph theoretical approach for predicting common RNA secondary structure motifs including pseudoknots in unaligned sequences , 2004, Bioinform..

[4]  Panos M. Pardalos,et al.  The maximum clique problem , 1994, J. Glob. Optim..

[5]  J. Jeffry Howbert,et al.  The Maximum Clique Problem , 2007 .

[6]  Wayne J. Pullan,et al.  Dynamic Local Search for the Maximum Clique Problem , 2011, J. Artif. Intell. Res..

[7]  Roberto Battiti,et al.  Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning , 1999, IEEE Trans. Computers.

[8]  G. Stormo,et al.  A graph theoretical approach for predicting common RNA secondary structure motifs including pseudoknots in unaligned sequences. , 2004, Bioinformatics.

[9]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[10]  Mauro Brunato,et al.  Reactive Search and Intelligent Optimization , 2008 .

[11]  Roberto Battiti,et al.  Reactive Local Search for the Maximum Clique Problem1 , 2001, Algorithmica.

[12]  Wilbert E. Wilhelm,et al.  Clique-detection models in computational biochemistry and genomics , 2006, Eur. J. Oper. Res..

[13]  Ulrik Brandes,et al.  Efficient generation of large random networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[15]  Joseph C. Culberson,et al.  Camouflaging independent sets in quasi-random graphs , 1993, Cliques, Coloring, and Satisfiability.

[16]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.