Annealed replication: A new heuristic for the maximum clique problem

Discrete Applied Mathematics

Volumn 121, Issue 1-3, 2002, Pages 27-49

  Bomze, Immanuel M ^a   Budinich, Marco ^b   Pelillo, Marcello ^c   Rossi, Claudio ^c  

^a UNIVERSITY OF VIENNA   (Austria)

^b UNIVERSITY OF TRIESTE   (Italy)

^c CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

Combinatorial optimization; Dynamical systems; Independent set; Quadratic optimization; Replicator dynamics; Stable set

Indexed keywords

EID: 84867960097     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00233-5     Document Type: Article

References (42)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and the hardness of approximation problems, Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, PA, 1992, pp. 14-23.
2. S. Arora, S. Safra, Probabilistic checking of proofs: a new characterization of NP, Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, PA, 1992, pp. 2-13.
3. M. Bellare, S. Goldwasser, C. Lund, A. Russell, Efficient probabilistically checkable proofs and application to approximation, Proceedings of the 25th Annual ACM Symposium on Theory Comput., San Diego, CA, 1993, pp. 294-304. (Pubitemid 23668767)
4. M. Bellare, S. Goldwasser, M. Sudan, Free bits, PCPs and non-approximability - towards tight results, Proceedings of the 36th Annual Symposium on Foundations of Computer Science, Milwaukee, WI, 1995, pp. 422-431.
5. L.E. Baum, and J.A. Eagon An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology Bull. Amer. Math. Soc. 73 1967 360 363
6. L.E. Baum, and G.R. Sell Growth transformations for functions on manifolds Pacific J. Math. 27 2 1968 211 227
7. I.M. Bomze Lotka-Volterra equation and replicator dynamics: a two-dimensional classification Biol. Cybernet. 48 1983 201 211
8. I.M. Bomze Non-cooperative two-person games in biology: a classification Internat. J. Game Theory 15 1986 31 57
9. I.M. Bomze Lotka-Volterra equation and replicator dynamics: new issues in classification Biol. Cybernet. 72 1995 447 453
10. I.M. Bomze Evolution towards the maximum clique J. Global Optim. 10 1997 143 164 (Pubitemid 127502309)
11. I.M. Bomze, M. Budinich, P.M. Pardalos, and M. Pelillo The maximum clique problem D.Z. Du, P.M. Pardalos, Handbook of Combinatorial Optimization (suppl. Vol. A) 1999 Kluwer Dordrecht 1 74
12. I.M. Bomze, M. Pelillo, and R. Giacomini Evolutionary approach to the maximum clique problem: Empirical evidence on a larger scale I.M. Bomze, T. Csendes, R. Horst, P.M. Pardalos, Developments in Global Optimization 1997 Kluwer Dordrecht 95 108
13. I.M. Bomze, and F. Rendl Replicator dynamics for evolution towards the maximum clique: variations and experiments R. De Leone, A. Murli, P.M. Pardalos, G. Toraldo, High Performance Algorithms and Software in Nonlinear Optimization 1998 Kluwer Dordrecht 53 68
14. I.M. Bomze, and V. Stix Genetic engineering via negative fitness: evolutionary dynamics for global optimization Ann. Oper. Res. 89 1999 297 318
15. M. Budinich, Bounds on the maximum clique of a graph, Disc. Appl. Math., to appear.
16. J.F. Crow, and M. Kimura An Introduction to Population Genetics Theory 1970 Harper & Row New York
17. U. Feige, S. Goldwasser, L. Lovász, S. Safra, M. Szegedy, Approximating clique is almost NP-complete, Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1991, pp. 2-12.
18. U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy Interactive proofs and the hardness of approximating clique J. ACM 43 2 1996 268 292
19. R.A. Fisher The Genetical Theory of Natural Selection 1930 Clarendon Press Oxford
20. A.H. Gee, and R.W. Prager Polyhedral combinatorics and neural networks Neural Comput. 6 1994 161 180
21. L.E. Gibbons, D.W. Hearn, and P.M. Pardalos A continuous based heuristic for the maximum clique problem D.S. Johnson, M. Trick, Cliques, Coloring, and Satisfiability - Second DIMACS Implementation Challenge 1996 American Mathematical Society Providence, RI 103 124
22. L.E. Gibbons, D.W. Hearn, P.M. Pardalos, and M.V. Ramana Continuous characterizations of the maximum clique problem Math. Oper. Res. 22 3 1997 754 768 (Pubitemid 127653360)
23. 1-ε, Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996, pp. 627-636.
24. J. Hofbauer, and K. Sigmund The Theory of Evolution and Dynamical Systems 1988 Cambridge University Press Cambridge, UK
25. D.S. Johnson, M.A. Trick (Eds.), Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26, American Mathematical Society, Providence, RI, 1996 (see also http://dimacs.rutgers.edu/Volumes/Vol26.html).
26. S. Karlin Mathematical models, problems and controversies of evolutionary theory Bull. Amer. Math. Soc. 10 1984 221 273
27. A. Kelley The stable, center-stable, center, center-unstable, unstable manifolds J. Differential Equations 3 1967 546 570
28. A. Kelley Stability of the center-stable manifold J. Math. Anal. Appl. 18 1967 336 344
29. M. Kimura On the change of population fitness by natural selection Heredity 12 1958 145 167
30. S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi Optimization by simulated annealing Science 220 4598 1983 671 679
31. S.E. Levinson, L.R. Rabiner, and M.M. Sondhi An introduction to the application of the theory of probabilistic functions of a Markov process to automatic speech recognition Bell System Tech. J. 62 1983 1035 1074
32. D.W. Matula, The largest clique size in a random graph, Technical Report CS 7608, Department of Computer Science, Southern Methodist University, 1976.
33. T.S. Motzkin, and E.G. Straus Maxima for graphs and a new proof of a theorem of Turán Canad. J. Math. 17 1965 533 540
34. C.H. Papadimitriou, and K. Steiglitz Combinatorial Optimization: Algorithms and Complexity 1982 Prentice-Hall Englewood Cliffs, NJ
35. P.M. Pardalos Continuous approaches to discrete optimization problems G. Di Pillo, F. Giannessi, Nonlinear Optimization and Applications 1996 Plenum Press New York 313 328
36. P.M. Pardalos, and A.T. Phillips A global optimization approach for solving the maximum clique problem Internat. J. Computer Math. 33 1990 209 216
37. M. Pelillo Relaxation labeling networks for the maximum clique problem J. Artificial Neural Networks 2 1995 313 328
38. M. Pelillo The dynamics of nonlinear relaxation labeling processes J. Math. Imaging Vision 7 4 1997 309 323 (Pubitemid 127507091)
39. M. Pelillo, and A. Jagota Feasible and infeasible maxima in a quadratic program for maximum clique J. Artificial Neural Networks 2 1995 411 419
40. P. Taylor, and L. Jonker Evolutionarily stable strategies and game dynamics Math. Biosci. 40 1978 145 156 (Pubitemid 8403401)
41. A. Torsello, and M. Pelillo Continuous-time relaxation labeling processes Pattern Recognition 33 2000 1897 1908
42. J.W. Weibull Evolutionary Game Theory 1995 MIT Press Cambridge, MA