Exact algorithms for the minimum cost vertex blocker clique problem

Abstract We study the minimum cost vertex blocker clique problem (CVCP), which is defined as follows. Given a simple undirected graph with weights and costs on its vertices and r > 0, detect a minimum cost subset of vertices to be removed such that the weight of any clique in the remaining graph is at most r. We propose a new characterization of the set of feasible solutions that results in new linear 0–1 programming formulations solved by lazy-fashioned branch-and-cut algorithms. A new set of facet-inducing inequalities for the convex hull of feasible solutions to CVCP are also identified. We also propose new combinatorial bounding schemes and employ them to develop the first combinatorial branch-and-bound algorithm for this problem. The computational performance of these exact algorithms is studied on a test-bed of randomly generated graphs, and real-life instances.

[1]  R. Kevin Wood,et al.  Shortest‐path network interdiction , 2002, Networks.

[2]  Hossein Taghizadeh Kakhki,et al.  Two extended formulations for cardinality maximum flow network interdiction problem , 2017, Networks.

[3]  D. de Werra,et al.  Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid , 2010, Discret. Math..

[4]  Harvey J. Greenberg,et al.  Emerging Theory, Methods, and Applications , 2005 .

[5]  John Scott.  What is social network analysis , 2010 .

[6]  Eduardo L. Pasiliao,et al.  Minimum edge blocker dominating set problem , 2015, Eur. J. Oper. Res..

[7]  Zsolt Tuza,et al.  The most vital nodes with respect to independent set and vertex cover , 2011, Discret. Appl. Math..

[8]  R. Luce,et al.  A method of matrix analysis of group structure , 1949, Psychometrika.

[9]  Wilbert E. Wilhelm,et al.  Clique-detection models in computational biochemistry and genomics , 2006, Eur. J. Oper. Res..

[10]  W. C. Turner,et al.  Optimal interdiction policy for a flow network , 1971 .

[11]  Marco Di Summa,et al.  Complexity of the critical node problem over trees , 2011, Comput. Oper. Res..

[12]  Panos M. Pardalos,et al.  On New Approaches of Assessing Network Vulnerability: Hardness and Approximation , 2012, IEEE/ACM Transactions on Networking.

[13]  Özlem Ergun,et al.  The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximability , 2010, Oper. Res. Lett..

[14]  Maw-Sheng Chern,et al.  The Most Vital Edges in the Minimum Spanning Tree Problem , 1993, Inf. Process. Lett..

[15]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994 .

[16]  R. Kevin Wood,et al.  Deterministic network interdiction , 1993 .

[17]  Jeffrey Scott Vitter,et al.  External memory algorithms , 1998, ESA.

[18]  Ryan A. Rossi,et al.  The Network Data Repository with Interactive Graph Analytics and Visualization , 2015, AAAI.

[19]  Matteo Fischetti,et al.  A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs , 2017, Oper. Res..

[20]  Daniel Vanderpooten,et al.  Critical edges/nodes for the minimum spanning tree problem: complexity and approximation , 2013, J. Comb. Optim..

[21]  Sabrina De Capitani di Vimercati,et al.  An OBDD approach to enforce confidentiality and visibility constraints in data publishing , 2012, J. Comput. Secur..

[22]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[23]  Samir Khuller,et al.  The complexity of finding most vital arcs and nodes , 1995 .

[24]  Rico Zenklusen,et al.  Matching interdiction , 2008, Discret. Appl. Math..

[25]  Eduardo L. Pasiliao,et al.  An integer programming framework for critical elements detection in graphs , 2014, J. Comb. Optim..

[26]  Roberto Solis-Oba,et al.  Increasing the weight of minimum spanning trees , 1996, SODA '96.

[27]  Patric R. J. Östergård,et al.  A New Algorithm for the Maximum-Weight Clique Problem , 1999, Electron. Notes Discret. Math..

[28]  Man Lung Yiu,et al.  Finding k most influential edges on flow graphs , 2017, Inf. Syst..

[29]  J. Moon,et al.  On cliques in graphs , 1965 .

[30]  Panos M. Pardalos,et al.  Detecting critical nodes in sparse graphs , 2009, Comput. Oper. Res..

[31]  Lei Xie,et al.  Detecting evolutionary relationships across existing fold space, using sequence order-independent profile–profile alignments , 2008, Proceedings of the National Academy of Sciences.

[32]  Panos M. Pardalos,et al.  Mining market data: A network approach , 2006, Comput. Oper. Res..

[33]  Vladimir Gurvich,et al.  On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction , 2008, Theory of Computing Systems.

[34]  Nam P. Nguyen,et al.  On the Discovery of Critical Links and Nodes for Assessing Network Vulnerability , 2013, IEEE/ACM Transactions on Networking.

[35]  Dominique de Werra,et al.  Blockers and transversals , 2009, Discret. Math..

[36]  Eduardo L. Pasiliao,et al.  Minimum vertex blocker clique problem , 2014, Networks.

[37]  Rico Zenklusen,et al.  Network flow interdiction on planar graphs , 2010, Discret. Appl. Math..

[38]  My T. Thai,et al.  Bound and exact methods for assessing link vulnerability in complex networks , 2014, J. Comb. Optim..

[39]  T. S. Evans,et al.  Clique graphs and overlapping communities , 2010, ArXiv.

[40]  Panos M. Pardalos,et al.  The maximum clique problem , 1994, J. Glob. Optim..

[41]  John R. Jungck,et al.  Chapter 1 – Graph Theory for Systems Biology: Interval Graphs, Motifs, and Pattern Recognition , 2015 .

[42]  Eduardo L. Pasiliao,et al.  Exact identification of critical nodes in sparse networks via new compact formulations , 2014, Optim. Lett..

[43]  Laura M. Glass,et al.  Social contact networks for the spread of pandemic influenza in children and teenagers , 2008, BMC public health.

[44]  J. M. Arroyo,et al.  A Genetic Algorithm Approach for the Analysis of Electric Grid Interdiction with Line Switching , 2009, 2009 15th International Conference on Intelligent System Applications to Power Systems.

[45]  Paolo Toth,et al.  Dynamic programming algorithms for the Zero-One Knapsack Problem , 1980, Computing.

[46]  Philip E. Bourne,et al.  A unified statistical model to support local sequence order independent similarity searching for ligand-binding sites and its application to genome-based drug discovery , 2009, Bioinform..

[47]  Marco Di Summa,et al.  Branch and cut algorithms for detecting critical nodes in undirected graphs , 2012, Computational Optimization and Applications.

[48]  Richard D. Wollmer,et al.  Removing Arcs from a Network , 1964 .

[49]  Jonathan Cole Smith,et al.  A class of algorithms for mixed-integer bilevel min–max optimization , 2015, Journal of Global Optimization.