Parameterized Inapproximability of Target Set Selection and Generalizations
Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora · Computability · 2014
In this paper, we consider the TARGET SET SELECTION problem: given a graph and a threshold value thr(v) for each vertex v of the graph, find a minimum size vertex-subset to “activate” such that all vertices of the graph are activated at the end of th