A Fast Local Search Algorithm for Minimum Weight Dominating Set Problem on Massive Graphs

The minimum weight dominating set (MWDS) problem is NP-hard and also important in many applications. Recent heuristic MWDS algorithms can hardly solve massive real world graphs effectively. In this paper, we design a fast local search algorithm called FastMWDS for the MWDS problem, which aims to obtain a good solution on massive graphs within a short time. In this novel local search framework, we propose two ideas to make it effective. Firstly, we design a new fast construction procedure with four reduction rules to cut down the size of massive graphs. Secondly, we propose the three-valued two-level configuration checking strategy to improve local search, which is interestingly a variant of configuration checking (CC) with two levels and multiple values. Experiment results on a broad range of massive real world graphs show that FastMWDS finds much better solutions than state of the art MWDS algorithms.

[1]  M. Montaz Ali,et al.  An Effective Hybrid Memetic Algorithm for the Minimum Weight Dominating Set Problem , 2016, IEEE Transactions on Evolutionary Computation.

[2]  Wei Wu,et al.  CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability , 2015, IEEE Transactions on Computers.

[3]  Vasco M. Manquinho,et al.  Open-WBO: A Modular MaxSAT Solver, , 2014, SAT.

[4]  Kaile Su,et al.  A Reduction based Method for Coloring Very Large Graphs , 2017, IJCAI.

[5]  Piek Vossen,et al.  23rd International Conference on Computational Linguistics , 2010 .

[6]  Leszek Gasieniec,et al.  Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms , 2007, SODA 2007.

[7]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[8]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[9]  Minghao Yin,et al.  Two Efficient Local Search Algorithms for Maximum Weight Clique Problem , 2016, AAAI.

[10]  Chao Gao,et al.  A weighting-based local search heuristic algorithm for the Set Covering Problem , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

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

[12]  M. Pollack.  Journal of Artificial Intelligence Research: Preface , 2001 .

[13]  B. C. Brookes,et al.  Information Sciences , 2020, Cognitive Skills You Need for the 21st Century.

[14]  Carlos Ansótegui,et al.  Exploiting the Structure of Unsatisfiable Cores in MaxSAT , 2015, IJCAI.

[15]  David Chalupa,et al.  An order-based algorithm for minimum dominating set with application in graph mining , 2017, Inf. Sci..

[16]  Antonio Sassano,et al.  A Lagrangian-based heuristic for large-scale set covering problems , 1998, Math. Program..

[17]  Fabrizio Grandoni,et al.  A measure & conquer approach for the analysis of exact algorithms , 2009, JACM.

[18]  Zhang Hai,et al.  SCIENCE CHINA Information Sciences , 2010 .

[19]  J. Bautista,et al.  Modeling the problem of locating collection areas for urban waste management. An application to the metropolitan area of Barcelona , 2006 .

[20]  Michael J. Todd,et al.  Mathematical programming , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[21]  Minghao Yin,et al.  Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function , 2017, J. Artif. Intell. Res..

[22]  Michele Amoretti,et al.  Simulation Modelling Practice and Theory , 2015 .

[23]  Alex Rogers,et al.  Ieee Transactions on Evolutionary Computation Genetic Drift in Genetic Algorithm Selection Schemes , 1999 .

[24]  Christian Blum,et al.  A hybrid algorithmic model for the minimum weight dominating set problem , 2016, Simul. Model. Pract. Theory.

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

[26]  Hua Jiang,et al.  An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs , 2017, AAAI.

[27]  Shaowei Cai,et al.  Finding A Small Vertex Cover in Massive Sparse Graphs: Construct, Local Search, and Preprocess , 2017, J. Artif. Intell. Res..

[28]  Michael I. Jordan,et al.  Advances in Neural Information Processing Systems 30 , 1995 .

[29]  Minghao Yin,et al.  A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity , 2015, Science China Information Sciences.

[30]  Alok Singh,et al.  Hybrid metaheuristic algorithms for minimum weight dominating set , 2013, Appl. Soft Comput..

[31]  M. Golumbic.  Annals of Mathematics and Artificial Intelligence , 2004, Annals of Mathematics and Artificial Intelligence.

[32]  Zhanxing Zhu,et al.  Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence , 2016, AAAI 2016.

[33]  R. Lathe.  Phd by thesis , 1988, Nature.

[34]  Ieee Journal On Selected Areas In Communications, Vol. 9, No. 6, August 1991 , .

[35]  Wanru Gao,et al.  Scaling up Local Search for Minimum Vertex Cover in Large Graphs by Parallel Kernelization , 2017, Australasian Conference on Artificial Intelligence.

[36]  Yang Yu,et al.  Subset Selection by Pareto Optimization , 2015, NIPS.

[37]  Maggie X. Cheng.  Journal of combinatorial optimization, special issue on communication networks and internet applications , 2006 .

[38]  Wei-Ying Ma,et al.  Query Selection Techniques for Efficient Crawling of Structured Web Sources , 2006, 22nd International Conference on Data Engineering (ICDE'06).