Tabu search with graph reduction for finding maximum balanced bicliques in bipartite graphs

Abstract The Maximum Balanced Biclique Problem is a relevant graph model with a number of applications in diverse domains. However, the problem is NP-hard and thus computationally challenging. In this paper, we introduce a novel metaheuristic algorithm, which combines an effective constraint-based tabu search procedure and two dedicated graph reduction techniques. We verify the effectiveness of the algorithm on 30 classical random benchmark graphs and 25 very large real-life sparse graphs from the popular Koblenz Network Collection (KONECT). The results show that the algorithm improves the best-known results (new lower bounds) for 10 classical benchmarks and obtains the optimal solutions for 14 KONECT instances.

[1]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Jinyan Li,et al.  Maximal Quasi-Bicliques with Balanced Noise Tolerance: Concepts and Co-clustering Applications , 2008, SDM.

[3]  Wei-keng Liao,et al.  Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs , 2012, WAW.

[4]  Bin Li,et al.  A Fast Extraction Algorithm for Defect-Free Subcrossbar in Nanoelectronic Crossbar , 2014, ACM J. Emerg. Technol. Comput. Syst..

[5]  Fikret S. Gürgen,et al.  Scalable and adaptive collaborative filtering by mining frequent item co-occurrences in a user feedback stream , 2017, Eng. Appl. Artif. Intell..

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

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

[8]  Vojtech Rödl,et al.  The algorithmic aspects of the regularity lemma , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[9]  Mauro Birattari,et al.  The irace Package: Iterated Race for Automatic Algorithm , 2011 .

[10]  Bin Li,et al.  A New Evolutionary Algorithm with Structure Mutation for the Maximum Balanced Biclique Problem , 2015, IEEE Transactions on Cybernetics.

[11]  Ali Hamzeh,et al.  Trust based latency aware influence maximization in social networks , 2015, Eng. Appl. Artif. Intell..

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

[13]  George M. Church,et al.  Biclustering of Expression Data , 2000, ISMB.

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

[15]  Dhiraj K. Pradhan,et al.  A Defect Tolerance Scheme for Nanotechnology Circuits , 2007, IEEE Transactions on Circuits and Systems I: Regular Papers.

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

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  Jérôme Kunegis,et al.  KONECT: the Koblenz network collection , 2013, WWW.

[19]  Bo Yuan,et al.  A low time complexity defect-tolerance algorithm for nanoelectronic crossbar , 2011, International Conference on Information Science and Technology.

[20]  Panos M. Pardalos,et al.  A new exact maximum clique algorithm for large and massive sparse graphs , 2016, Comput. Oper. Res..

[21]  Boris A. Galitsky.  Improving relevance in a content pipeline via syntactic generalization , 2017, Eng. Appl. Artif. Intell..

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

[23]  Andrea Giovannucci,et al.  Enacting agent-based services for automated procurement , 2008, Eng. Appl. Artif. Intell..

[24]  Leslie Pérez Cáceres,et al.  The irace package: Iterated racing for automatic algorithm configuration , 2016 .

[25]  Yi Zhou,et al.  Frequency-driven tabu search for the maximum s-plex problem , 2017, Comput. Oper. Res..

[26]  Jin-Kao Hao,et al.  Solving the winner determination problem via a weighted maximum clique heuristic , 2015, Expert Syst. Appl..

[27]  Dhruv Mubayi,et al.  Finding bipartite subgraphs efficiently , 2009, Inf. Process. Lett..

[28]  Shimon Kogan,et al.  Hardness of approximation of the Balanced Complete Bipartite Subgraph problem , 2004 .

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

[30]  Ciaran McCreesh,et al.  An Exact Branch and Bound Algorithm with Symmetry Breaking for the Maximum Balanced Induced Biclique Problem , 2014, CPAIOR.

[31]  Yi Zhou,et al.  Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs , 2018, Eur. J. Oper. Res..

[32]  Mehdi Baradaran Tahoori,et al.  Application-independent defect tolerance of reconfigurable nanoarchitectures , 2006, JETC.

[33]  Milind Dawande,et al.  On Bipartite and Multipartite Clique Problems , 2001, J. Algorithms.