Fast local search for the maximum independent set problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5038 LNCS, Issue , 2008, Pages 220-234

  Andrade, Diogo V ^a   Resende, Mauricio G C ^b   Werneck, Renato F ^c  

^a GOOGLE INC   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EVOLUTIONARY ALGORITHMS; HEURISTIC PROGRAMMING; KETONES; ONLINE SEARCHING;

CARDINALITY; EXPERIMENTAL ALGORITHMS; FAST LOCAL SEARCH (FLS); HEIDELBERG (CO); INDEPENDENT SETS; INTERNATIONAL (CO); LINEAR TIME; MAXIMAL SOLUTIONS; MAXIMUM INDEPENDENT SET (MIS); SINGLE VERTEX; SPRINGER (CO);

SET THEORY;

EID: 45449101127     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68552-4_17     Document Type: Conference Paper

References (18)

1. Battiti, R., Protasi, M.: Reactive local search for the maximum clique problem. Algorithmica 29(4), 610-637 (2001)
2. Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization (Sup. Vol. A), pp. 1-74. Kluwer, Dordrecht (1999)
3. Butenko, S., Pardalos, P.M., Sergienko, I., Shylo, V., Stetsyuk, P.: Finding maximum independent sets in graphs arising from coding theory. In: Proceedings of the 2002 ACM Symposium on Applied Computing, pp. 542-546 (2002)
4. Butenko, S., Pardalos, P.M., Sergienko, I., Shylo, V., Stetsyuk, P.: Estimating the size of correcting codes using extremal graph problems. In: Pearce, C. (ed.) Optimization: Structure and Applications, Springer, Heidelberg (2008)
5. Demetrescu, C., Goldberg, A.V., Johnson, D.S.: 9th DIMACS Implementation Challenge: Shortest Paths (2006) (last visited on March 15, 2008), http://www.dis.uniroma1.it/∼challenge9
6. Feo, T., Resende, M.G.C., Smith, S.: A greedy randomized adaptive search procedure for maximum independent set. Operations Research 42, 860-878 (1994)
7. Grosso, A., Locatelli, M., Della Croce, F.: Combining swaps and node weights in an adaptive greedy approach for the maximum clique problem. J. Heuristics 10, 135-152 (2004)
8. Grosso, A., Locatelli, M., Pullan, W.: Simple ingredients leading to very efficient heuristics for the maximum clique problem. J. Heuristics (30 October, 2007), doi:10.1007/s10732-007-9055-x
9. Hansen, P., Mladenović, N., Urošević, D.: Variable neighborhood search for the maximum clique. Discrete Applied Mathematics 145(1), 117-125 (2004)
10. Johnson, D.S., Trick, M.: Cliques, Coloring and Satisfiability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26. AMS (1996)
11. Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85-103. Plenum Press, New York (1972)
12. Katayama, K., Hamamoto, A., Narihisa, H.: An effective local search for the maximum clique problem. Information Processing Letters 95, 503-511 (2005)
13. Loureņo, H.R., Martin, O., Stützle, T.: Iterated local search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 321-353. Kluwer, Dordrecht (2003)
14. Pullan, W.J., Hoos, H.H.: Dynamic local search for the maximum clique problem. J. Artificial Intelligence Research 25, 159-185 (2006)
15. Richter, S., Helmert, M., Gretton, C.: A stochastic local search approach to vertex cover. In: Proceedings of the 30th German Conference on Artificial Intelligence (KI), pp. 412-426 (2007)
16. Sander, P.V., Nehab, D., Chlamtac, E., Hoppe, H.: Efficient traversal of mesh edges (submitted, 2008)
17. Sloane, N.J.A.: Challenge problems: Independent sets in graphs (2000) (last visited on March 15, 2008), http://www.research.att.com/∼njas/doc/ graphs.html
18. Xu, K.: BHOSLIB: Benchmarks with hidden optimum solutions for graph problems (2004) (last visited on March 15, 2008), http://www.nlsde.buaa.edu.cn/ ∼kexu/benchmarks/graph-benchmarks.htm