Controlling Infection by Blocking Nodes and Links Simultaneously

  • Jing He
  • Hongyu Liang
  • Hao Yuan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7090)

Abstract

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. 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 \(\frac{3}{2}\)-approximation for MGNS(1) on bipartite graphs.

     
  2. 2

    We prove that for all d ∈ ℕ ∪ { ∞ }, it is \(\mathcal{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 \((\frac{3}{2}-\epsilon)\)-approximation for MGNS(d) in polynomial time. Our hardness results hold for the special case GNS(d) in [19] as well.

     
  3. 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 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.

     

Keywords

Approximation Algorithm Polynomial Time Vertex Cover Social Optimum Tight Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Arora, S., Rao, S., Vazirani, U.: Expander flows, geomeric embeddings and graph partitioning. In: Proceedings of the 35th ACM STOC (2004)Google Scholar
  2. 2.
    Arulselvan, A., Commander, C.W., Elefteriadou, L., Pardalos, P.M.: Detecting critical nodes in sparse graphs. Comput. Oper. Res. 36(7), 2193–2200 (2009)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Aspnes, J., Chang, K.L., Yampolskiy, A.: Inoculation strategies for victims of viruses and the sum-of-squares partition problem. J. Comput. Syst. Sci. 72(6), 1077–1093 (2005); Preliminary version in SODA 2005MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Borgatti, S.: Identifying sets of key players in a social network. Comput. Math. Org. Theory 12, 21–34 (2006)CrossRefMATHGoogle Scholar
  5. 5.
    Chen, P.-A., David, M., Kempe, D.: Better vaccination strategies for better people. In: Proceedings of the 11th ACM EC (2010)Google Scholar
  6. 6.
    Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2009)Google Scholar
  7. 7.
    Di Summa, M., Grosso, A., Locatelli, M.: Complexity of the critical node problem over trees. Comput. Oper. Res. 38(12), 1766–1774 (2011)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2001)Google Scholar
  9. 9.
    Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Comput. 25(2), 235–251 (1993); Preliminary version in STOC 1993MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Goyal, A., Bonchi, F., Lakshmanan, L.V.S.: Learning influence probabilities in social networks. In: Proceedings of the 3rd ACM WSDM (2010)Google Scholar
  11. 11.
    Halperin, E.: Improved approximation algorithms for the vertex cover problem in graphs and hypergraph. SIAM J. Comput. 31(5), 1608–1623 (2002)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2003)Google Scholar
  13. 13.
    Khot, S.: On the power of unique 2-prover 1-round games. In: Proceedings of the 34th ACM STOC (2002)Google Scholar
  14. 14.
    Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2 − ε. J. Comput. Syst. Sci. 74(3), 335–349 (2003); Preliminary version in CCC 2003MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Kimura, M., Saito, K.: Tractable Models for Information Diffusion in Social Networks. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 259–271. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  16. 16.
    Kimura, M., Saito, K., Motoda, H.: Minimizing the spread of contamination by blocking links in a network. In: Proceedings of the 23rd AAAI Conference on Artificial Intelligence (2008)Google Scholar
  17. 17.
    Kimura, M., Saito, K., Motoda, H.: Solving the Contamination Minimization Problem on Networks for the Linear Threshold Model. In: Ho, T.-B., Zhou, Z.-H. (eds.) PRICAI 2008. LNCS (LNAI), vol. 5351, pp. 977–984. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  18. 18.
    Kimura, M., Saito, K., Motoda, H.: Blocking links to minimize contamination spread in a social network. ACM Trans. Knowl. Discov. Data. 3(2) (2009)Google Scholar
  19. 19.
    Anil Kumar, V.S., Rajaraman, R., Sun, Z., Sundaram, R.: Existence theorems and approximation algorithms for generalized network security games. In: Proceedings of the 30th ICDCS (2010)Google Scholar
  20. 20.
    Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.S.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2007)Google Scholar
  21. 21.
    Li, A., Tang, L.: The Complexity and Approximability of Minimum Contamination Problems. In: Ogihara, M., Tarui, J. (eds.) TAMC 2011. LNCS, vol. 6648, pp. 298–307. Springer, Heidelberg (2011)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Jing He
    • 1
  • Hongyu Liang
    • 1
  • Hao Yuan
    • 2
  1. 1.Institute for Interdisciplinary Information SciencesTsinghua UniversityChina
  2. 2.Department of Computer ScienceCity University of Hong KongHong Kong

Personalised recommendations