The Complexity of Multiterminal Cuts
SIAM Journal on Computing
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
SIAM Journal on Computing
Inoculation strategies for victims of viruses and the sum-of-squares partition problem
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the hardness of optimization in power-law graphs
Theoretical Computer Science
Blocking links to minimize contamination spread in a social network
ACM Transactions on Knowledge Discovery from Data (TKDD)
Minimizing the spread of contamination by blocking links in a network
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Covering a Graph with a Constrained Forest (Extended Abstract)
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Approximation hardness for small occurrence instances of NP-hard problems
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
Controlling infection by blocking nodes and links simultaneously
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
A derandomized approximation algorithm for the critical node detection problem
Computers and Operations Research
| Hi-index | 0.00 |
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 + ε,O(1+ε/εlog n))-bicriteria approximation algorithm for the Minimum Average Contamination Problem. Moreover, we show that theMinimumAverage 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.