Deterministic Tournament Selection in Local Search for Maximum Edge Weight Clique on Large Sparse Graphs

The maximum edge weight clique (MEWC) problem is important in both theories and applications. During last decades, there has been much interest in finding optimal or near-optimal solutions to this problem. Many existing heuristics focuses on academic benchmarks of relatively small size. However, very little attention has been paid to solving the MEWC problem in large sparse graphs. In this work, we exploit the so-called deterministic tournament selection (DTS) strategy to improve the local search MEWC algorithms. Experiments conducted on a broad range of large sparse graphs show that our algorithm outperforms state-of-the-art local search algorithms in this benchmark. Moreover it finds better solutions on a list of them.

[1]  Longin Jan Latecki,et al.  Sequential Monte Carlo for Maximum Weight Subgraphs with Application to Solving Image Jigsaw Puzzles , 2014, International Journal of Computer Vision.

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

[3]  Uriel Feige,et al.  Approximating Maximum Clique by Removing Subgraphs , 2005, SIAM J. Discret. Math..

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

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

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

[7]  Ke Xu,et al.  An Exact Algorithm Based on MaxSAT Reasoning for the Maximum Weight Clique Problem , 2016, J. Artif. Intell. Res..

[8]  Fred W. Glover,et al.  Solving the maximum edge weight clique problem via unconstrained quadratic programming , 2007, Eur. J. Oper. Res..

[9]  Ke Xu,et al.  Solving Maximum Weight Clique Using Maximum Satisfiability Reasoning , 2014, ECAI.

[10]  Kamil Adamczewski,et al.  Discrete Tabu Search for Graph Matching , 2015, 2015 IEEE International Conference on Computer Vision (ICCV).

[11]  Longin Jan Latecki,et al.  Maximum weight cliques with mutex constraints for video object segmentation , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[12]  David E. Goldberg,et al.  Genetic Algorithms, Tournament Selection, and the Effects of Noise , 1995, Complex Syst..

[13]  Mauro Brunato,et al.  Predicting Structural and Functional Sites in Proteins by Searching for Maximum-weight Cliques , 2010, AAAI.

[14]  Chi Wang,et al.  Differential geometric treewidth estimation in adiabatic quantum computation , 2016, Quantum Information Processing.

[15]  Marcin Grzegorzek,et al.  Skeleton Graph Matching vs. Maximum Weight Cliques aorta registration techniques , 2015, Comput. Medical Imaging Graph..

[16]  Pedro Martins,et al.  Solving the maximum edge-weight clique problem in sparse graphs with compact formulations , 2015, EURO J. Comput. Optim..

[17]  Longin Jan Latecki,et al.  Unsupervised object region proposals for RGB-D indoor scenes , 2017, Comput. Vis. Image Underst..

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

[19]  Mason A. Porter,et al.  Social Structure of Facebook Networks , 2011, ArXiv.

[20]  Shaowei Cai,et al.  Fast Solving Maximum Weight Clique Problem in Massive Graphs , 2016, IJCAI.

[21]  Wayne J. Pullan,et al.  Approximating the maximum vertex/edge weighted clique using local search , 2008, J. Heuristics.