Minimum vertex blocker clique problem

We study the minimum vertex blocker clique problem VBCP,1 which is to remove a subset of vertices of minimum cardinality in a weighted undirected graph, such that the maximum weight of a clique in the remaining graph is bounded above by a given integer ri¾?1. Cliques are among the most popular concepts used to model cohesive clusters in different graph-based applications, such as social, biological, and communication networks. The general case of VBCP on weighted graphs is known to be NP-hard, and we show that the special case on unweighted graphs is also NP-hard for any fixed integer ri¾?1. We present an analytical lower bound on the cardinality of an optimal solution to VBCP, as well as formulate VBCP as a linear 0-1 program with an exponential number of constraints. Facet-inducing inequalities for the convex hull of feasible solutions to VBCP are also identified. Furthermore, we develop the first exact algorithm for solving VBCP, which solves the proposed formulation by using a row generation approach. Computational results obtained by utilizing this algorithm on a test-bed of randomly generated instances are also provided. © 2014 Wiley Periodicals, Inc. NETWORKS, Vol. 641, 48-64 2014

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

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

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

[4]  Martin C. Frith,et al.  SeqVISTA: a graphical tool for sequence feature visualization and comparison , 2003, BMC Bioinformatics.

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

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

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

[8]  A. J. van der Beek,et al.  Design of a RCT evaluating the (cost-) effectiveness of a lifestyle intervention for male construction workers at risk for cardiovascular disease: The Health under Construction study , 2008, BMC public health.

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

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

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

[12]  Egon Balas,et al.  Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs , 1992, SIAM J. Comput..

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

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

[15]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

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

[17]  L. Mirny,et al.  Protein complexes and functional modules in molecular networks , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[18]  Gary D. Bader,et al.  An automated method for finding molecular complexes in large protein interaction networks , 2003, BMC Bioinformatics.

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

[20]  Daniel Vanderpooten,et al.  Complexity of determining the most vital elements for the p-median and p-center location problems , 2010, Journal of Combinatorial Optimization.

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

[22]  John M. Lewis,et al.  The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..

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

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

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