Local Search with Noisy Strategy for Minimum Vertex Cover in Massive Graphs

Finding minimum vertex covers (MinVC) for simple undirected graphs is a well-known NP-hard problem. In the literature there have been many heuristics for obtaining good vertex covers. However, most of them focus on solving this problem in relatively small graphs. Recently, a local search solver called FastVC is designed to solve the MinVC problem on real-world massive graphs. Since the traditional best-picking heuristic was believed to be of high complexity, FastVC replaces it with an approximate best-picking strategy. However, since best-picking has been proved to be powerful for a wide range of problems, abandoning it may be a great sacrifice. In this paper we have developed a local search MinVC solver which utilizes best-picking with noise to remove vertices. Experiments conducted on a broad range of real-world massive graphs show that our proposed method finds better vertex covers than state-of-the-art local search algorithms on many graphs.

[1]  Aravind Srinivasan,et al.  Structural and algorithmic aspects of massive social networks , 2004, SODA '04.

[2]  F. Chung,et al.  Complex Graphs and Networks , 2006 .

[3]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[4]  Ryan A. Rossi,et al.  The Network Data Repository with Interactive Graph Analytics and Visualization , 2015, AAAI.

[5]  David S. Johnson,et al.  Cliques, Coloring, and Satisfiability , 1996 .

[6]  Mason A. Porter,et al.  Social Structure of Facebook Networks , 2011, ArXiv.

[7]  Ryan A. Rossi,et al.  Coloring large complex networks , 2014, Social Network Analysis and Mining.

[8]  Kengo Katayama,et al.  An effective local search for the maximum clique problem , 2005, Inf. Process. Lett..

[9]  Ryan A. Rossi,et al.  Fast maximum clique algorithms for large graphs , 2014, WWW.

[10]  Shaowei Cai,et al.  Balance between Complexity and Quality: Local Search for Minimum Vertex Cover in Massive Graphs , 2015, IJCAI.

[11]  Malte Helmert,et al.  A Stochastic Local Search Approach to Vertex Cover , 2007, KI.

[12]  Chu-Min Li,et al.  An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem , 2010 .

[13]  Abdul Sattar,et al.  NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover , 2014, J. Artif. Intell. Res..

[14]  Valmir Carneiro Barbosa,et al.  A Novel Evolutionary Formulation of the Maximum Independent Set Problem , 2003, J. Comb. Optim..

[15]  Pablo San Segundo,et al.  An exact bit-parallel algorithm for the maximum clique problem , 2011, Comput. Oper. Res..

[16]  Abdul Sattar,et al.  Local search with edge weighting and configuration checking heuristics for minimum vertex cover , 2011, Artif. Intell..

[17]  G. Stormo,et al.  A graph theoretical approach for predicting common RNA secondary structure motifs including pseudoknots in unaligned sequences. , 2004, Bioinformatics.

[18]  Diogo Vieira Andrade,et al.  Fast local search for the maximum independent set problem , 2012, J. Heuristics.

[19]  Jin-Kao Hao,et al.  General swap-based multiple neighborhood tabu search for the maximum independent set problem , 2015, Eng. Appl. Artif. Intell..

[20]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[21]  Kaile Su,et al.  EWLS: A New Local Search for Minimum Vertex Cover , 2010, AAAI.

[22]  Wayne J. Pullan,et al.  Dynamic Local Search for the Maximum Clique Problem , 2011, J. Artif. Intell. Res..

[23]  G. Crooks,et al.  Protein secondary structure: entropy, correlations and prediction. , 2003, Bioinformatics.

[24]  Qinghua Wu,et al.  A review on algorithms for maximum clique problems , 2015, Eur. J. Oper. Res..