An Efficient Local Search Algorithm for Minimum Weighted Vertex Cover on Massive Graphs

The minimum weighted vertex cover (MWVC) problem is a well known NP-hard problem with various real-world applications. In this paper, we design an efficient algorithm named FastWVC to solve MWVC problem in massive graphs. Two strategies are proposed. One is the ConstructWVC procedure, aiming to generate a quality initial vertex cover. The other is a new exchange step for reconstructing a vertex cover. Experiments on 102 instances were conducted to confirm the effectiveness of our algorithm. The results show that the FastWVC algorithm outperforms other algorithms in terms of both solution quality and computational time in most of the instances.

[1]  Christian Blum,et al.  A population-based iterated greedy algorithm for the minimum weight vertex cover problem , 2012, Appl. Soft Comput..

[2]  Abdul Sattar,et al.  Local Search with Noisy Strategy for Minimum Vertex Cover in Massive Graphs , 2016, PRICAI.

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

[4]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

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

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

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

[8]  Milan Tuba,et al.  An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem , 2011, Appl. Soft Comput..

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

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

[11]  Yang Wang,et al.  Multi-start iterated tabu search for the minimum weight vertex cover problem , 2016, J. Comb. Optim..

[12]  Abdul Sattar,et al.  Random Walk in Large Real-World Graphs for Finding Smaller Vertex Cover , 2016, 2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI).

[13]  Christian Komusiewicz,et al.  Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem , 2017, AAAI.

[14]  Minghao Yin,et al.  An efficient local search framework for the minimum weighted vertex cover problem , 2016, Inf. Sci..

[15]  ALOK SINGH,et al.  A Hybrid Heuristic for the Minimum Weight Vertex Cover Problem , 2006, Asia Pac. J. Oper. Res..

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

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