Controlling infection by blocking nodes and links simultaneously

In this paper we study the problem of controlling the spread of undesirable things (viruses, epidemics, rumors, etc.) in a network. We present a model called the mixed generalized network security model, denoted by MGNS(d), which unifies and generalizes several well-studied infection control model in the literature. Intuitively speaking, our goal under this model is to secure a subset of nodes and links in a network so as to minimize the expected total loss caused by a possible infection (with a spreading limit of d-hops) plus the cost spent on the preventive actions. Our model has wide applications since it incorporates both node-deletion and edge-removal operations. Our main results are as follows: 1 For all 1 ≤ d <∞, we present a polynomial time (d+1)-approximation algorithm for computing the optimal solution of MGNS(d). This improves the approximation factor of 2d obtained in [19] for a special case of our model. We derive an O(logn)-approximation for the case d = ∞. Moreover, we give a polynomial time 3/2-approximation for MGNS(1) on bipartite graphs. 2 We prove that for all d ∈ ν ∪ {∞}, it is APX-hard to compute the optimum cost of MGNS(d) even on 3-regular graphs. We also show that, assuming the Unique Games Conjecture 13, we cannot obtain a (3/2- ε-approximation for MGNS(d) in polynomial time. Our hardness results hold for the special case GNS(d) in [19] as well. 3 We show that an optimal solution of MGNS(d) can be found in polynomial time for every fixed d ∈ ν ∪ {∞} if the underlying graph is a tree, and the in infection cost and attack probability are both uniform. Our algorithm also works for the case where there are budget constraints on the number of secured nodes and edges in a solution. This in particular settles an open question from [21] that asks whether there exists an efficient algorithm for the minimum average contamination problem on trees. © 2011 Springer-Verlag Berlin Heidelberg.