Latency-Bounded Target Set Selection in Signed Networks
نویسندگان
چکیده
منابع مشابه
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 (thresholds), and the objective is to determine a small set of vertices (target set) that activates a given number (or a given subset) of vertices ...
متن کاملWeighted Target Set Selection on Social Networks
Viral marketing and influence maximization on social networks has become a problem of significant interest. We consider a problem in this setting referred to as the weighted target set selection (WTSS) problem. Earlier research focused on approximation algorithms for the unweighted case of the problem which is known to be NP-hard. Motivated by the desire to develop a better understanding of fun...
متن کاملTarget set selection problem for honeycomb networks
Let G be a graph with a threshold function θ : V (G) → N such that 1 ≤ θ(v) ≤ dG(v) for every vertex v of G, where dG(v) is the degree of v in G. Suppose we are given a target set S ⊆ V (G). The paper considers the following repetitive process on G. At time step 0 the vertices of S are colored black and the other vertices are colored white. After that, at each time step t > 0, the colors of whi...
متن کاملOn Approximating Target Set Selection
We study the Target Set Selection (TSS) problem introduced by Kempe, Kleinberg, and Tardos (2003). This problem models the propagation of influence in a network, in a sequence of rounds. A set of nodes is made “active” initially. In each subsequent round, a vertex is activated if at least a certain number of its neighbors are (already) active. In the minimization version, the goal is to activat...
متن کاملTarget Set Selection in Dense Graph Classes
In this paper we study the Target Set Selection problem, a fundamental problem in computational social choice, from a parameterized complexity perspective. Here for a given graph and a threshold for each vertex the task is to find a set of active vertices that activates whole graph. A vertex becomes active if the number of activated vertices in its neighborhood is at least its threshold. We giv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2020
ISSN: 1999-4893
DOI: 10.3390/a13020032