A New “Annealed” Heuristic for the Maximum Clique Problem
We propose a new heuristic for approximating the maximum clique problem based on a detailed analysis of a class of continuous optimization models which provide a complete characterization of solutions to this NP-hard combinatorial problem. We start from a known continuous formulation of the maximum clique, and tackle the search for local solutions with replicator dynamics Hereby, we add to the objective used in previous works a regularization term that controls the global shape of the energy landscape, that is the function actually maximized by the dynamics. The parameter controlling the regularization is changed during the evolution of the dynamical system to render inefficient local solutions (which formerly were stable) unstable, thus conducting the system to escape from sub-optimal points, and so to improve the final results. The role of this parameter is thus superficially similar to that of temperature in simulated annealing in the sense that its variation allows to find better solutions for the problem at hand. We report on the performances of this approach when applied to selected DIMACS benchmark graphs.
KeywordsMaximum Clique Heuristic.
Unable to display preview. Download preview PDF.
- I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo (1999), “The maximum clique problem,” to appear in: D. Z. Du and P. M. Pardalos, editors, Handbook of Combinatorial Optimization (Vol. 4) Kluwer, Dordrecht.Google Scholar
- I. M. Bomze, M. Budinich, M. Pelillo and C. Rossi (1999), “Annealed Replication: a New Heuristic for the Maximum Clique Problem,” to appear in: Discrete Applied Mathematics. Google Scholar
- I. M. Bomze and F. Rendi (1998), “Replicator dynamics for evolution towards the maximum clique: variations and experiments,” in: R. De Leone, A. Murli, P.M. Pardalos, and G. Toraldo (Eds.), High Performance Algorithms and Software in Nonlinear Optimization, Kluwer, Dordrecht, pp. 53–68.CrossRefGoogle Scholar
- M. Budinich (1999), “Bounds on the maximum clique of a graph,” submitted (see http://www.is.infn.it/-mbh/MC_Bounds.ps.Z).
- J. F. Crow and M. Kimura. (1970), An Introduction to Population Genetics Theory. Harper & Row, New York.Google Scholar
- L. E. Gibbons, D. W. Hearn, and P. M. Pardalos (1996), “A continuous based heuristic for the maximum clique problem,” In: D. S. Johnson and M. Trick (Eds.), Cliques,Coloring, and Satisfiability—Second DIMACS Implementation Challenge. American Mathematical Society, Providence, RI, pp. 103–124.Google Scholar
- J. Hofbauer and K. Sigmund. (1998), The Theory of Evolution and Dynamical Systems,Cambridge University Press, Cambridge, UK.Google Scholar
- D. S. Johnson and M. A. Trick (Eds.) (1996), Cliques, Coloring,and Satisfiability: Second DIMACS Implementation Challenge, DI- MACS Series in Discrete Mathematics and Theoretical Computer Science, Vol 26, American Mathematical Society, Providence, RI (sec also http://dimacs.rutgers.edu/Volumes/Vo126.html).
- D. W. Matula (1976), “The largest clique size in a random graph,” Technical Report CS 7608, Department of Computer Science, Southern Methodist University.Google Scholar
- C. H. Papadimitriou and K. Steiglitz (1982), Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ.Google Scholar
- P. M. Pardalos (1996), “Continuous approaches to discrete optimization problems,” In: G. Di Pillo and F. Giannessi (Eds.), Nonlinear Or ‘imization and Applications. Plenum Press, New York, pp. 313–328.Google Scholar
- M. Pelillo (1995), “Relaxation labeling networks for the maximum clique problem,” J. Artif. Neural Networks, vol. 2, pp. 313–328.Google Scholar
- M. Pelillo and A. Jagota (1995), “Feasible and infeasible maxima in a quadratic program for maximum clique,” J. Artif. Neural Networks, vol. 2, pp. 411–419.Google Scholar
- A. Torsello and M. Pelillo (1999), “Continuous-time relaxation labeling processes,” Pattern Recognition, accepted for publication.Google Scholar