Mar 14, 2014 · In this paper, we consider the Target Set Selection problem: given a graph and a threshold value thr(v) for any vertex v of the graph, find a ...

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 ...

Abstract. In this paper, we consider the Target Set Selection prob- lem: given a graph and a threshold value thr(v) for each vertex v of the.

In this paper, we consider the Target Set Selection problem: given a graph and a threshold value for each vertex v of the graph, find a minimum size vertex- ...

For the special case of unanimity thresholds, we showed that the problem is still inapproximable in polynomial time, but becomes r(n)-approximable in fpt-time.

PDF | In this paper, we consider the Target Set Selection problem: given a graph and a threshold value for each vertex v of the graph, find a minimum.

Abstract. 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, ...

In this paper, we consider the Target Set Selection problem: given a graph and a threshold value thr(v) for any vertex v of the graph, find a minimum size ...

Parameterized Inapproximability of Target Set Selection and Generalizations · Journal Title · Journal ISSN · Volume Title · Publication Type.

Parameterized inapproximability of target set selection and generalizations. C Bazgan, M Chopin, A Nichterlein, F Sikora. Computability 3 (2), 135-145, 2014.