Frequency-driven tabu search for the maximum s-plex problem

Abstract The maximum s -plex problem is an important model for social network analysis and other studies. In this study, we present an effective frequency-driven multi-neighborhood tabu search algorithm (FD-TS) to solve the problem on very large networks. The proposed FD-TS algorithm relies on two transformation operators ( Add and Swap ) to locate high-quality solutions, and a frequency-driven perturbation operator ( Press ) to escape and search beyond the identified local optimum traps. We report computational results for 47 massive real-life (sparse) graphs from the SNAP Collection and the 10th DIMACS Challenge, as well as 52 (dense) graphs from the 2nd DIMACS Challenge (results for 48 more graphs are also provided in the Appendix). We demonstrate the effectiveness of our approach by presenting comparisons with the current best-performing algorithms.

[1]  Bin Wu,et al.  A Parallel Algorithm for Enumerating All the Maximal k -Plexes , 2007, PAKDD Workshops.

[2]  Anurag Verma,et al.  Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks , 2015, INFORMS J. Comput..

[3]  Sergiy Butenko,et al.  A network-based data mining approach to portfolio selection via weighted clique relaxations , 2014, Ann. Oper. Res..

[4]  Alexander Veremyev,et al.  Identifying large robust network clusters via new compact formulations of maximum k-club problems , 2012, Eur. J. Oper. Res..

[5]  Ravi Kumar,et al.  Discovering Large Dense Subgraphs in Massive Graphs , 2005, VLDB.

[6]  Wayne J. Pullan,et al.  Dynamic Local Search for the Maximum Clique Problem , 2011, J. Artif. Intell. Res..

[7]  Sergiy Butenko,et al.  On clique relaxation models in network analysis , 2013, Eur. J. Oper. Res..

[8]  Patric R. J. Östergård,et al.  A fast algorithm for the maximum clique problem , 2002, Discret. Appl. Math..

[9]  Sergiy Butenko,et al.  Algorithms for the maximum k-club problem in graphs , 2013, J. Comb. Optim..

[10]  Illya V. Hicks,et al.  Combinatorial algorithms for the maximum k-plex problem , 2012, J. Comb. Optim..

[11]  Jin-Kao Hao,et al.  Breakout Local Search for maximum clique problems , 2013, Comput. Oper. Res..

[12]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures: Advances and Extensions , 2018, Handbook of Metaheuristics.

[13]  P. Pardalos,et al.  An exact algorithm for the maximum clique problem , 1990 .

[14]  Qinghua Wu,et al.  A review on algorithms for maximum clique problems , 2015, Eur. J. Oper. Res..

[15]  W. Alshehri,et al.  Clique relaxation models in social network analysis , 2011 .

[16]  Rolf Niedermeier,et al.  Exact combinatorial algorithms and experiments for finding maximum k-plexes , 2012, J. Comb. Optim..

[17]  Sandra Sudarsky,et al.  Massive Quasi-Clique Detection , 2002, LATIN.

[18]  Mark Gerstein,et al.  Predicting interactions in protein networks by completing defective cliques , 2006, Bioinform..

[19]  Stephen B. Seidman,et al.  A graph‐theoretic generalization of the clique concept* , 1978 .

[20]  Balabhaskar Balasundaram,et al.  Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts , 2018, Optim. Lett..

[21]  Gilbert Laporte,et al.  Heuristics for finding k-clubs in an undirected graph , 2000, Comput. Oper. Res..

[22]  Amirhossein Meisami,et al.  A Hybrid Metaheuristic for the Maximum k-Plex Problem , 2014, Examining Robustness and Vulnerability of Networked Systems.

[23]  Sergiy Butenko,et al.  On the maximum quasi-clique problem , 2013, Discret. Appl. Math..

[24]  Mauro Brunato,et al.  On Effectively Finding Maximal Quasi-cliques in Graphs , 2008, LION.

[25]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[26]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures: Advances, Hybridizations, and Applications , 2010 .

[27]  Sergiy Butenko,et al.  Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem , 2011, Oper. Res..

[28]  Yi Zhou,et al.  PUSH: A generalized operator for the Maximum Vertex Weight Clique Problem , 2017, Eur. J. Oper. Res..

[29]  Sergiy Butenko,et al.  Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations , 2013, Computational Optimization and Applications.

[30]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[31]  Fred W. Glover,et al.  Multi-neighborhood tabu search for the maximum weight clique problem , 2012, Annals of Operations Research.

[32]  David A. Bader,et al.  Graph Partitioning and Graph Clustering, 10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology, Atlanta, GA, USA, February 13-14, 2012. Proceedings , 2013, Graph Partitioning and Graph Clustering.

[33]  Balabhaskar Balasundaram,et al.  A branch-and-bound approach for maximum quasi-cliques , 2014, Ann. Oper. Res..

[34]  Eduardo L. Pasiliao,et al.  Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs , 2016, Comput. Optim. Appl..

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

[36]  Jin-Kao Hao,et al.  An adaptive multistart tabu search approach to solve the maximum clique problem , 2013, J. Comb. Optim..