Phased local search for the maximum clique problem

This paper introduces Phased Local Search (PLS), a new stochastic reactive dynamic local search algorithm for the maximum clique problem. (PLS) interleaves sub-algorithms which alternate between sequences of iterative improvement, during which suitable vertices are added to the current clique, and plateau search, where vertices of the current clique are swapped with vertices not contained in the current clique. The sub-algorithms differ in their vertex selection techniques in that selection can be solely based on randomly selecting a vertex, randomly selecting within highest vertex degree or randomly selecting within vertex penalties that are dynamically adjusted during the search. In addition, the perturbation mechanism used to overcome search stagnation differs between the sub-algorithms. (PLS) has no problem instance dependent parameters and achieves state-of-the-art performance for the maximum clique problem over a large range of the commonly used DIMACS benchmark instances.

[1]  Kengo Katayama,et al.  Solving the maximum clique problem by k-opt local search , 2004, SAC '04.

[2]  Mauricio G. C. Resende,et al.  Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP , 1998, TOMS.

[3]  Egon Balas,et al.  Finding a Maximum Clique in an Arbitrary Graph , 1986, SIAM J. Comput..

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

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Lars Engebretsen,et al.  Clique Is Hard To Approximate Within , 2000 .

[7]  Pavel A. Pevzner,et al.  Combinatorial Approaches to Finding Subtle Signals in DNA Sequences , 2000, ISMB.

[8]  Federico Della Croce,et al.  Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem , 2004, J. Heuristics.

[9]  Wayne J. Pullan,et al.  Simple ingredients leading to very efficient heuristics for the maximum clique problem , 2008, J. Heuristics.

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

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

[12]  David S. Johnson,et al.  Cliques, Coloring, and Satisfiability , 1996 .

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

[14]  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.

[15]  Ravi B. Boppana,et al.  Approximating maximum independent sets by excluding subgraphs , 1990, BIT.

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

[17]  Elena Marchiori,et al.  Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem , 2002, EvoWorkshops.

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

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

[20]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[21]  Stanislav Busygin,et al.  A new trust region technique for the maximum weight clique problem , 2006, Discret. Appl. Math..

[22]  Pierre Hansen,et al.  Variable neighborhood search for the maximum clique , 2001, Discret. Appl. Math..