Abstract
In this article, we investigate the complexity and approximability of the Minimum Contamination Problems, which are derived from epidemic spreading areas and have been extensively studied recently. We show that both the Minimum Average Contamination Problem and the Minimum Worst Contamination Problem are NP-hard problems even on restrict cases. For any ε> 0, we give \((1+\epsilon, O(\frac{1+\epsilon}{\epsilon}\log n))\)-bicriteria approximation algorithm for the Minimum Average Contamination Problem. Moreover, we show that the Minimum Average Contamination Problem is NP-hard to be approximated within 5/3 − ε and the Minimum Worst Contamination Problem is NP-hard to be approximated within 2 − ε, for any ε> 0, giving the first hardness results of approximation of constant ratios to the problems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aspnes, J., Chang, K., Yampolskiy, A.: Inoculation Strategies for Victims of Viruses and the Sum-of-Squares Partition Problem. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 43–52 (2005)
Anshelevich, E., D. Kempe. Prophylactic Vaccination of Networks (to appear)
Bazgan, C., Couëtoux, B., Tuza, Z.: Covering a Graph with a Constrained Forest (Extended Abstract). In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 892–901. Springer, Heidelberg (2009)
Cheeger, J.: A Lower Bound for the Smallest Eigenvalues of the Laplacian. In: Problem in Analysis (Papers dedicated to Salomon Bochner,1969), pp. 195–199. Princeton Univ. Press, Princeton (1970)
Chlebik, M., Chlebikova, J.: Approximation hardness for small occurrence instances of NP-hard problems. In: Petreschi, R., Persiano, G., Silvestri, R. (eds.) CIAC 2003. LNCS, vol. 2653, pp. 152–164. Springer, Heidelberg (2003)
Dahlhaus, E., Johnson, D., Papadimitriou, C., Seymour, P., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comp. 23, 864–894 (1994)
Ferrante, A., Pandurangan, G., Park, K.: On the hardness of optimization in power-law graphs. Theoretical Computer Science 393(1-3), 220–230 (2008)
Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Comput. 25(2), 235–251 (1996)
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, pp. 1175–1180 (2008)
Kimura, M., Saito, K., Motoda, H.: Blocking links to minimize contamination spread in a social network. ACM Transactions on Knowledge Discovery from Data (TKDD 3(2), 1–23 (2009)
Kumar, V., Rajaraman, R., Sun, Z., Sundaram, R.: Existence Theorems and Approximation Algorithms for Generalized Network Security Games. In: The 30th International Conference on Distributed Computing Systems (2010) (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, A., Tang, L. (2011). The Complexity and Approximability of Minimum Contamination Problems. In: Ogihara, M., Tarui, J. (eds) Theory and Applications of Models of Computation. TAMC 2011. Lecture Notes in Computer Science, vol 6648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20877-5_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-20877-5_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20876-8
Online ISBN: 978-3-642-20877-5
eBook Packages: Computer ScienceComputer Science (R0)