Parameterized Inapproximability of Target Set Selection and Generalizations
In this paper, we consider the Target Set Selection problem: given a graph and a threshold value Open image in new window for each vertex v of the graph, find a minimum size vertex-subset to “activate” s.t. all the vertices of the graph are activated at the end of the propagation process. A vertex v is activated during the propagation process if at least Open image in new window of its neighbors are activated. This problem models several practical issues like faults in distributed networks or word-to-mouth recommendations in social networks. We show that for any functions f and ρ this problem cannot be approximated within a factor of ρ(k) in f(k) ·n O(1) time, unless FPT = W[P], even for restricted thresholds (namely constant and majority thresholds). We also study the cardinality constraint maximization and minimization versions of the problem for which we prove similar hardness results.
KeywordsBipartite Graph Vertex Cover Input Node Computable Function Satisfying Assignment
Unable to display preview. Download preview PDF.
- 2.Arora, S., Lund, C.: Hardness of approximations. In: Approximation Algorithms for NP-Hard Problems, pp. 399–446. PWS Publishing Company (1996)Google Scholar
- 11.Dinur, I., Safra, S.: The importance of being biased. In: Proc. of STOC 2002, pp. 33–42. ACM (2002)Google Scholar
- 13.Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer (2013)Google Scholar
- 15.Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)Google Scholar
- 16.Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: Proc. of KDD 2003, pp. 137–146. ACM (2003)Google Scholar
- 19.Nichterlein, A., Niedermeier, R., Uhlmann, J., Weller, M.: On tractable cases of target set selection. Soc. Network Anal. Mining 3(2), 233–256 (1869) ISSN 1869-5450Google Scholar
- 20.Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)Google Scholar