Efficient Local Search for Minimum Dominating Sets in Large Graphs

The Minimum Dominating Set (MinDS) problem is an NP-hard problem of great importance in both theories and applications. In this paper, we propose a new local search algorithm ScBppw (Score Checking and Best-picking with Probabilistic Walk) to solve the MinDS problem in large graphs. For diversifying the search, our algorithm exploits a tabu strategy, called Score Checking (SC), which forbids a vertex to be added into the current candidate solution if the vertex’s score has not been changed since the last time it was removed out of the candidate solution. Also, to keep a good balance between intensification and diversification during the search, we propose a strategy that combines, in a novel way, best-picking with probabilistic walk at removing stages. At this stage, the algorithm selects a vertex with the minimum loss, or other vertices in the candidate solution with a probability proportional to the their degrees, depending on how repeatedly the area has been visited. Experimental results show that our solver significantly outperforms state-of-the-art MinDS solvers. Also we conducted several experiments to show the individual impacts of our novelties.

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

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

[3]  Rolf Niedermeier,et al.  Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case , 2002, SWAT.

[4]  Abdul Sattar,et al.  Local Search for Maximum Vertex Weight Clique on Large Sparse Graphs with Efficient Data Structures , 2016, Australasian Conference on Artificial Intelligence.

[5]  T. Akutsu,et al.  Minimum dominating set-based methods for analyzing biological networks. , 2016, Methods.

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

[7]  Kaile Su,et al.  Restart and Random Walk in Local Search for Maximum Vertex Weight Cliques with Evaluations in Clustering Aggregation , 2017, IJCAI.

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

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

[10]  Stefan Woltran,et al.  Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning , 2015, IJCAI.

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

[12]  Thomas Stützle,et al.  Stochastic Local Search , 2007, Handbook of Approximation Algorithms and Metaheuristics.

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

[14]  Michael A. Henning,et al.  Domination in Graphs Applied to Electric Power Networks , 2002, SIAM J. Discret. Math..

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

[16]  Weihua Zhuang,et al.  DTN Based Dominating Set Routing for MANET in Heterogeneous Wireless Networking , 2009, Mob. Networks Appl..

[17]  Tao Li,et al.  Multi-Document Summarization via the Minimum Dominating Set , 2010, COLING.

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

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

[20]  Chakravarthy Bhagvati,et al.  Novel Morphological Algorithms for Dominating Sets on Graphs with Applications to Image Analysis , 2012, IWCIA.

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

[22]  Abdel-Rahman Hedar,et al.  Simulated annealing with stochastic local search for minimum dominating set problem , 2011, International Journal of Machine Learning and Cybernetics.

[23]  Minghao Yin,et al.  A Fast Local Search Algorithm for Minimum Weight Dominating Set Problem on Massive Graphs , 2018, IJCAI.

[24]  Alina Campan,et al.  Fast Dominating Set Algorithms for Social Networks , 2015, MAICS.

[25]  Fei-Fei Li,et al.  Action Recognition with Exemplar Based 2.5D Graph Matching , 2012, ECCV.

[26]  Tony Greenfield,et al.  Theory and Problems of Probability and Statistics , 1982 .