Dynamic local search for the maximum clique problem

Journal of Artificial Intelligence Research

Volumn 25, Issue , 2006, Pages 159-185

  Pullan, Wayne ^a   Hoos, Holger H ^b  

^a GRIFFITH UNIVERSITY   (Australia)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BENCHMARKING; PARAMETER ESTIMATION; PERTURBATION TECHNIQUES;

DYNAMIC LOCAL SEARCH (DLS); MAXIMUM CLIQUE (MC); PLATEAU SEARCH;

STOCHASTIC CONTROL SYSTEMS;

EID: 33744489605     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1815     Document Type: Article

References (26)

1. Balus, E., & Yu, C. (1986). Finding a maximum clique in an arbitary graph. SIAM Journal of Computing, 75(4), 1054-1068.
2. Battiti, R., & Protasi, M. (2001). Reactive local search for the maximum clique problem. Algorithmica, 29, 610-637.
3. Battiti, R., & Tecchiolli, G. (1994). The reactive tabu search. ORSA Journal on Computing, 6(2), 126-140.
4. Bomze, I., Budinich, M., Pardalos, P., & Pelillo, M. (1999). The maximum clique problem. In D.Z. Du, P. P. (Ed.), Handbook of Combinatorial Optimization, Vol. A, pp. 1-74.
5. Boppana, R., & Halldórsson, M. (1992). Approximating maximum independent sets by excluding subgraphs. Bit, 32, 180-196.
6. Brockington, M., & Culberson, J. (1996). Camouflaging independent sets in quasi-random graphs. In D.S. Johnson, M. T. (Ed.), Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, Vol. 26 of DIMACS Series. American Mathematical Society.
7. Busygin, S. (2002). A new trust region technique for the maximum clique problem. Internal report, http://www.busygin.dp.ua.
8. Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, USA.
9. Grosso, A., Locatelli, M., & Croce, F. D. (2004). Combining swaps and node weights in an adaptive greedy approach for the maximum clique problem. Journal of Heuristics, 10, 135-152.
10. 1-ε. Acta Mathematica, 182, 105-142.
11. Hoos, H. H. (2002). An adaptive noise mechanism for WalkSAT. In Proceedings of the Eighteenth National Conference on Artificial Intelligence, pp. 655-660. AAAI Press / The MIT Press, Menlo Park, CA, USA.
12. Hoos, H. H., & Stützle, T. (2004). Stochastic Local Search: Foundations and Applications. Morgan Kaufmann Publishers, USA.
13. Hoos, H., & Stützle, T. (2000). Local search algorithms for SAT: An empirical evaluation. In Gent, I., v.Maaren, H., & Walsh, T. (Eds.), SAT 2000, pp. 43-86. IOS Press.
14. Hutter, F., Tompkins, D. A. D., & Hoos, H. H. (2002). Scaling and probabilistic smoothing: Efficient dynamic local search for SAT. In Hentenryck, P. V. (Ed.), Principles and Practice of Constraint Programming - CP 2002, Vol. 2470 of Lecture Notes in Computer Science, pp. 233-248. Springer Verlag, Berlin, Germany.
15. Ji, Y., Xu, X., & Stormo, G. D. (2004). A graph theoretical approach for predicting common RNA secondary structure motifs including pseudoknots in unaligned sequences. Bioinformatics, 20(10), 1591-1602.
16. Johnson, D., & Trick, M. (Eds.). (1996). Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, Vol. 26 of DIMACS Series. American Mathematical Society.
17. Katayama, K., Hamamoto, A., &: Narihisa, H. (2004). Solving the maximum clique problem by k-opt local search. In Proceedings of the 2004 ACM Symposium on Applied computing, pp. 1021-1025.
18. Marchiori, E. (2002). Genetic, iterated and multistart local search for the maximum clique problem. In Applications of Evolutionary Computing, Vol. 2279 of Lecture Notes in Computer Science, pp. 112-121. Springer Verlag, Berlin, Germany.
19. Pevzner, P. A., & Sze, S.-H. (2000). Combinatorial approaches to finding subtle signals in DNA sequences. In Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, pp. 269-278. AAAI Press.
20. Pullan, W., & Zhao, L. (2004). Resolvent clause weighting local search. In Tawfik, A. Y., & Goodwin, S. D. (Eds.), Advances in Artificial Intelligence, 17th Conference of the Canadian Society for Computational Studies of Intelligence, Vol. 3060 of Lecture Notes in Computer Science, pp. 233-247. Springer Verlag, Berlin, Germany.
21. Resende, M., Feo, T., & Smith, S. (1998). Algorithm 786: FORTRAN subroutine for approximate solution of the maximum independent set problem using GRASP. ACM Transactions on Mathematical Software, 24, 386-394.
22. Schuurmans, D., & Southey, F. (2000). Local search characteristics of incomplete SAT procedures. In Proceedings of the Seventeenth National Conference on Artificial Intelligence, pp. 297-302. AAAI Press / The MIT Press, Menlo Park, CA, USA.
23. Solnon, C., & Fenet, S. (2004). A study of aco capabilities for solving the maximum clique problem. Journal of Heuristics, to appear.
24. Thornton, J., Pham, D. N., Bain, S., & Ferreira, V. (2004). Additive versus multiplicative clause weighting for SAT. In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-04), pp. 191-196. AAAI Press / The MIT Press, Menlo Park, CA, USA.
25. Tompkins, D., & Hoos, H. (2003). Scaling and probabilistic smoothing: Dynamic local search for unweighted MAX-SAT. In Xiang, Y., & Chaib-draa, B. (Eds.), Advances in Artificial Intelligence, 16th Conference of the Canadian Society for Computational Studies of Intelligence, Vol. 2671 of Lecture Notes in Computer Science, pp. 145-159. Springer Verlag, Berlin, Germany.
26. Watson, J., Whitley, L., & Howe, A. (2005). Linking search space structure, run-time dynamics, and problem difficulty: A step toward demystifying tabu search. Journal of Artificial Intelligence, 24, 221-261.