Mining the network value of customers
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
SIAM Journal on Computing
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
SIAM Journal on Computing
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Identifying sets of key players in a social network
Computational & Mathematical Organization Theory
Inoculation strategies for victims of viruses and the sum-of-squares partition problem
Journal of Computer and System Sciences
Cost-effective outbreak detection in networks
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Vertex cover might be hard to approximate to within 2-ε
Journal of Computer and System Sciences
Detecting critical nodes in sparse graphs
Computers and Operations Research
Solving the Contamination Minimization Problem on Networks for the Linear Threshold Model
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Blocking links to minimize contamination spread in a social network
ACM Transactions on Knowledge Discovery from Data (TKDD)
Efficient influence maximization in social networks
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Minimizing the spread of contamination by blocking links in a network
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Learning influence probabilities in social networks
Proceedings of the third ACM international conference on Web search and data mining
Better vaccination strategies for better people
Proceedings of the 11th ACM conference on Electronic commerce
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
Complexity of the critical node problem over trees
Computers and Operations Research
The complexity and approximability of minimum contamination problems
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Tractable models for information diffusion in social networks
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
| Hi-index | 0.00 |
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≤dd+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. 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. 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.