Towards faster local search for minimum weight vertex cover on massive graphs

Abstract The minimum weight 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. To this end, we propose a construction procedure, which aims to generate a quality initial vertex cover in short time. We also propose a new exchange step for reconstructing a vertex cover. Additionally, a cost-effective strategy is used for choosing adding vertices, which can accelerate the algorithm. 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. We also carry out experiments that analyze the effectiveness of the underlying ideas.

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

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

[3]  Anand Subramanian,et al.  A hybrid iterated local search heuristic for the maximum weight independent set problem , 2018, Optim. Lett..

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

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

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

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

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

[9]  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..

[10]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[11]  Shaowei Cai,et al.  An Efficient Local Search Algorithm for Minimum Weighted Vertex Cover on Massive Graphs , 2017, SEAL.

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

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

[14]  Yaodong Ni,et al.  Minimum weight covering problems in stochastic environments , 2012, Inf. Sci..

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

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

[17]  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).

[18]  Markus Wagner,et al.  Improving local search in a minimum vertex cover solver for classes of networks , 2017, 2017 IEEE Congress on Evolutionary Computation (CEC).

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

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