Balance between Complexity and Quality: Local Search for Minimum Vertex Cover in Massive Graphs

The problem of finding a minimum vertex cover (MinVC) in a graph is a well known NP-hard problem with important applications. There has been much interest in developing heuristic algorithms for finding a "good" vertex cover in graphs. In practice, most heuristic algorithms for MinVC are based on the local search method. Previously, local search algorithms for MinVC have focused on solving academic benchmarks where the graphs are of relatively small size, and they are not suitable for solving massive graphs as they usually have highcomplexity heuristics. In this paper, we propose a simple and fast local search algorithm called FastVC for solving MinVC in massive graphs, which is based on two low-complexity heuristics. Experimental results on a broad range of real world massive graphs show that FastVC finds much better vertex covers (and thus also independent sets) than state of the art local search algorithms for MinVC.

[1]  Chu Min Li,et al.  Diversification and Determinism in Local Search for Satisfiability , 2005, SAT.

[2]  Kaile Su,et al.  Local search for Boolean Satisfiability with configuration checking and subscore , 2013, Artif. Intell..

[3]  Bertrand M. T. Lin,et al.  An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem , 2004, Ann. Oper. Res..

[5]  Kaile Su,et al.  Two Weighting Local Search for Minimum Vertex Cover , 2015, AAAI.

[6]  S. Safra,et al.  On the hardness of approximating minimum vertex cover , 2005 .

[7]  George Karakostas,et al.  A better approximation ratio for the vertex cover problem , 2005, TALG.

[8]  Klaudia Frankfurter.  Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .

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

[10]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[11]  Ke Xu,et al.  Combining Edge Weight and Vertex Weight for Minimum Vertex Cover Problem , 2014, FAW.

[12]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

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

[14]  Diogo Vieira Andrade,et al.  Fast local search for the maximum independent set problem , 2008, Journal of Heuristics.

[15]  Sadiq M. Sait,et al.  International Journal of Computer Networks & Communications (IJCNC) , 2011 .

[16]  Wayne Pullan,et al.  Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers , 2009, Discret. Optim..

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

[18]  Orhan Dagdeviren,et al.  Distributed Vertex Cover Algorithms For Wireless Sensor Networks , 2014, ArXiv.

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

[20]  Christopher D. Rosin.  Unweighted Stochastic Local Search can be Effective for Random CSP Benchmarks , 2014, ArXiv.

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

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

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

[24]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

[25]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

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

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

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

[29]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .