Cardinality-Constrained Critical Node Detection Problem

We consider methodologies for managing risk in a telecommunication network based on identification of the critical nodes. The objective is to minimize the number of vertices whose deletion results in disconnected components which are constrained by a given cardinality. This is referred to as the CARDINALITY CONSTRAINED CRITICAL NODE PROBLEM (CC-CNP), and finds application in epidemic control, telecommunications, and military tactical planning, among others. From a telecommunication perspective, the set of critical nodes helps determine which players should be removed from the network in the event of a virus outbreak. Conversely, in order to maintain maximum global connectivity, it should be ensured that the critical nodes remain intact and as secure as possible. The presence of these nodes make a network vulnerable to attacks as they are crucial for the overall connectivity. This is a variation of the CRITICAL NODE DETECTION PROBLEM which has a known complexity and heuristic procedure. In this chapter, we review the recent work in this area, provide formulations based on integer linear programming and develop heuristic procedures for CC-CNP. We also examine the relations of CC-CNP with the well known NODE DELETION PROBLEM and discuss complexity results as a result of this relation.

[1]  W. Spears,et al.  On the Virtues of Parameterized Uniform Crossover , 1995 .

[2]  Panos M. Pardalos,et al.  INTEGER FORMULATIONS FOR THE MESSAGE SCHEDULING PROBLEM ON CONTROLLER AREA NETWORKS , 2004 .

[3]  John M. Wilson,et al.  A genetic algorithm for the generalised assignment problem , 1997 .

[4]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[5]  Zhou Tao,et al.  Epidemic dynamics on complex networks , 2006 .

[6]  David Coley,et al.  Introduction to Genetic Algorithms for Scientists and Engineers , 1999 .

[7]  Paul R. Harper,et al.  A genetic algorithm for the project assignment problem , 2005, Comput. Oper. Res..

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

[9]  Valdis E. Krebs,et al.  Uncloaking Terrorist Networks , 2002, First Monday.

[10]  Mauricio G. C. Resende,et al.  A hybrid multistart heuristic for the uncapacitated facility location problem , 2006, Eur. J. Oper. Res..

[11]  Stephen P. Borgatti.  Identifying sets of key players in a network , 2003, IEMC '03 Proceedings. Managing Technologically Driven Organizations: The Human Side of Innovation and Change (IEEE Cat. No.03CH37502).

[12]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[13]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

[14]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[15]  Stephen P. Borgatti,et al.  Identifying sets of key players in a social network , 2006, Comput. Math. Organ. Theory.

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

[17]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

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

[19]  Narsingh Deo,et al.  Node-Deletion NP-Complete Problems , 1979, SIAM J. Comput..

[20]  Tao Zhou,et al.  Epidemic dynamics on complex networks , 2005, physics/0508096.

[21]  Reuven Cohen,et al.  Efficient immunization strategies for computer networks and populations. , 2002, Physical review letters.

[22]  Panos M. Pardalos,et al.  Theory and algorithms for cooperative systems , 2004 .

[23]  Mauricio G. C. Resende,et al.  A fast swap-based local search procedure for location problems , 2007, Ann. Oper. Res..

[24]  Alex Bavelas.  A Mathematical Model for Group Structures , 1948 .

[25]  Carsten Lund,et al.  The Approximation of Maximum Subgraph Problems , 1993, ICALP.