Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Latency-Bounded Target Set Selection in Social Networks   Motivated by applications in sociology, economy and medicine, we study
variants of the Target Set Selection problem, first proposed by Kempe,
Kleinberg and Tardos. In our scenario one is given a graph $G=(V,E)$, integer
values $t(v)$ for each vertex $v$ (\emph{thresholds}), and the objective is to
determine a small set of vertices (\emph{target set}) that activates a given
number (or a given subset) of vertices of $G$ \emph{within} a prescribed number
of rounds. The activation process in $G$ proceeds as follows: initially, at
round 0, all vertices in the target set are activated; subsequently at each
round $r\geq 1$ every vertex of $G$ becomes activated if at least $t(v)$ of its
neighbors are already active by round $r-1$. It is known that the problem of
finding a minimum cardinality Target Set that eventually activates the whole
graph $G$ is hard to approximate to a factor better than
$O(2^{\log^{1-\epsilon}|V|})$. In this paper we give \emph{exact} polynomial
time algorithms to find minimum cardinality Target Sets in graphs of bounded
clique-width, and \emph{exact} linear time algorithms for trees.

25
The categories of this paper are: patt-sol
12
The categories of this paper are: nucl-th
14
The categories of this paper are: math-ph
37
The categories of this paper are: supr-con
6
The categories of this paper are: astro-ph
26
The categories of this paper are: bayes-an
36
The categories of this paper are: cmp-lg
11
The categories of this paper are: hep-lat
13
The categories of this paper are: quant-ph
0
The categories of this paper are: hep-ph
9
The categories of this paper are: nlin
17
The categories of this paper are: q-fin
27
The categories of this paper are: comp-gas
34
The categories of this paper are: chem-ph
7
The categories of this paper are: hep-th
29
The categories of this paper are: funct-an