Journal of Heuristics

, Volume 18, Issue 4, pp 525–547 | Cite as

Fast local search for the maximum independent set problem

  • Diogo V. Andrade
  • Mauricio G. C. Resende
  • Renato F. Werneck
Article

Abstract

Given a graph G=(V,E), the independent set problem is that of finding a maximum-cardinality subset S of V such that no two vertices in S are adjacent. We introduce two fast local search routines for this problem. The first can determine in linear time whether a maximal solution can be improved by replacing a single vertex with two others. The second routine can determine in O(mΔ) time (where Δ is the highest degree in the graph) whether there are two solution vertices than can be replaced by a set of three. We also present a more elaborate heuristic that successfully applies local search to find near-optimum solutions to a wide variety of instances. We test our algorithms on instances from the literature as well as on new ones proposed in this paper.

Keywords

Maximum independent set Local search Iterated local search Algorithm engineering 

References

  1. Andrade, D.V., Resende, M.G.C., Werneck, R.F.: Fast local search for the maximum independent set problem. In: McGeoch, C.C. (ed.) Proc. 7th International Workshop on Experimental Algorithms (WEA), vol. 5038, pp. 220–234. Springer, Berlin (2008) Google Scholar
  2. Battiti, R., Protasi, M.: Reactive local search for the maximum clique problem. Algorithmica 29(4), 610–637 (2001) MathSciNetMATHCrossRefGoogle Scholar
  3. 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 Academic, Norwell (1999) Google Scholar
  4. 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) CrossRefGoogle Scholar
  5. 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, Berlin (2008) Google Scholar
  6. Demetrescu, C., Goldberg, A.V., Johnson, D.S.: 9th DIMACS Implementation Challenge: Shortest Paths (2006). http://www.dis.uniroma1.it/~challenge9. Last visited on March 15, 2008
  7. Feo, T., Resende, M.G.C., Smith, S.: A greedy randomized adaptive search procedure for maximum independent set. Oper. Res. 42, 860–878 (1994) MATHCrossRefGoogle Scholar
  8. 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) CrossRefGoogle Scholar
  9. Grosso, A., Locatelli, M., Pullan, W.: Simple ingredients leading to very efficient heuristics for the maximum clique problem. J. Heuristics 14(6), 587–612 (2008) CrossRefGoogle Scholar
  10. Hansen, P., Mladenović, N., Urošević, D.: Variable neighborhood search for the maximum clique. Discrete Appl. Math. 145(1), 117–125 (2004) MathSciNetMATHCrossRefGoogle Scholar
  11. Johnson, D.S., Trick, M. (eds.): Cliques, Coloring and Satisfiability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26. AMS, Providence (1996) MATHGoogle Scholar
  12. Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum, New York (1972) CrossRefGoogle Scholar
  13. Katayama, K., Hamamoto, A., Narihisa, H.: An effective local search for the maximum clique problem. Inf. Process. Lett. 95, 503–511 (2005) MathSciNetMATHCrossRefGoogle Scholar
  14. Lourenço, H.R., Martin, O., Stützle, T.: Iterated local search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 321–353. Kluwer Academic, Norwell (2003) Google Scholar
  15. Pullan, W.J., Hoos, H.H.: Dynamic local search for the maximum clique problem. J. Artif. Intell. Res. 25, 159–185 (2006) MATHGoogle Scholar
  16. 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) Google Scholar
  17. Sander, P.V., Nehab, D., Chlamtac, E., Hoppe, H.: Efficient traversal of mesh edges using adjacency primitives. ACM Trans. Graph. 27(5), 144:1–144:9 (2008) CrossRefGoogle Scholar
  18. Sloane, N.J.A.: Challenge problems: Independent sets in graphs (2000). http://www.research.att.com/~njas/doc/graphs.html. Last visited on March 15, 2008
  19. Xu, K.: BHOSLIB: Benchmarks with hidden optimum solutions for graph problems (2004). http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/graph-benchmarks.htm. Last visited on March 15, 2008

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Diogo V. Andrade
    • 1
  • Mauricio G. C. Resende
    • 2
  • Renato F. Werneck
    • 3
  1. 1.Google Inc.New YorkUSA
  2. 2.AT&T Labs ResearchFlorham ParkUSA
  3. 3.Microsoft Research Silicon ValleyMtn. ViewUSA

Personalised recommendations