Combining swaps and node weights in an adaptive greedy approach for the maximum clique problem

Journal of Heuristics

Volumn 10, Issue 2, 2004, Pages 135-152

  Grosso, A ^a   Locatelli, M ^a   Della Croce, F ^b  

^a UNIVERSITY OF TURIN   (Italy)

^b POLITECNICO DI TORINO   (Italy)

Author keywords

Adaptive search; Greedy algorithm; Maximum clique problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; HEURISTIC PROGRAMMING; ITERATIVE METHODS; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING;

ADAPTIVE APPROACH; COMPLEX HEURISTICS; GREEDY ALGORITHM; MAXIMUM CLIQUE PROBLEM;

ADAPTIVE SYSTEMS;

EID: 3543127753     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:HEUR.0000026264.51747.7f     Document Type: Article

References (17)

1. Battiti, R. and M. Protasi. (2001). "Reactive Local Search for the Maximum Clique Problem." Algorithmica 29(4), 610-637.
2. Bellare, M., O. Goldreich, and M. Sudan. (1998). "Free Bits, PCPs, and Nonapproximability - Towards Tight Results." SIAM Journal on Computing 27(3), 804-915.
3. Bomze, I.M., M. Budinich, P.M. Pardalos, and M. Pelillo. (1999). "The Maximum Clique Problem." In D.Z. Du and P.M. Pardalos (eds.), Handbook of Combinatorial Optimization, Suppl. vol. A, pp. 1-74.
4. Brockington, M. and J.C. Culberson. (1996). "Camouflaging Independent Sets in Quasi-Random Graph." In Johnson and Trick.
5. Burer, S., R.D.C. Monteiro, and Y. Zhang. (2002). "Maximum Stable Set Formulations and Heuristics Based on Continous Optimization." Mathematical Programming 94, 137-166.
6. Busygin, S. (2002a). "A New Trust Region Technique for the Maximum Clique Problem." Report submitted, available at http://www.busygin.dp.ua.
7. Busygin, S. (2002b). "A Simple Clique Camouflaging Against Greedy Maximum Clique Heuristics." Report available at http://www.busygin.dp.ua.
8. Busygin, S., S. Butenko, and P.M. Pardalos. (2002). "A Heuristic for the Maximum Independent Set Problem Based on Optimization of a Quadratic Over a Sphere." Journal of Combinatorial Optimization 21 (4), 111-137.
9. Feo, T.A., M.G.C. Resende, and S.M. Smith. (1994) "A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set." Operations Research 46(5), 860-878.
10. Garey, M. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co.
11. Jagota, A. and L.A. Sanchis. (2001). "Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique." Journal of Heuristics 7, 565-585.
12. Johnson, D.S. and M. Trick (eds.). (1996). "Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge." DIMACS Series, vol. 26, American Mathematical Society.
13. Motzkin, R.S. and E.G. Straus. (1965). "Maxima for Graphs and a New Poof of a Theorem of Turan." Canadian Journal of Mathematics 17(4), 533-540.
14. Östergard, P.R.J. (2002). "A Fast Algorithm for the Maximum Clique Problem." Discrete Applied Mathematics 120, 197-207.
15. Resende, M.G.C., T.A. Feo, and S.H. Smith. (1998). "Algorithm 786: FORTRAN Subroutines for Approximate Solution of the Maximum Independent Set Problem Using GRASP." ACM Transactions on Mathematical Software 24, 386-394.
16. Sanchis, L. and A. Jagota. (1996). "Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem." INFORMS Journal on Computing 8(2), 87-102.
17. Wood, D.R. (1997). "An Algorithm for Finding a Maximum Clique in a Graph." Operations Research Letters 21(5), 211-217.