Target Set Selection for Conservative Populations

by   Uriel Feige, et al.

Let G = (V,E) be a graph on n vertices, where d_v denotes the degree of vertex v, and t_v is a threshold associated with v. We consider a process in which initially a set S of vertices becomes active, and thereafter, in discrete time steps, every vertex v that has at least t_v active neighbors becomes active as well. The set S is contagious if eventually all V becomes active. The target set selection problem TSS asks for the smallest contagious set. TSS is NP-hard and moreover, notoriously difficult to approximate. In the conservative special case of TSS, t_v > 1/2d_v for every v ∈ V. In this special case, TSS can be approximated within a ratio of O(Δ), where Δ = max_v ∈ V[d_v]. In this work we introduce a more general class of TSS instances that we refer to as conservative on average (CoA), that satisfy the condition ∑_v∈ V t_v > 1/2∑_v ∈ V d_v. We design approximation algorithms for some subclasses of CoA. For example, if t_v ≥1/2d_v for every v ∈ V, we can find in polynomial time a contagious set of size Õ(Δ· OPT^2 ), where OPT is the size of a smallest contagious set in G. We also provide several hardness of approximation results. For example, assuming the unique games conjecture, we prove that TSS on CoA instances with Δ< 3 cannot be approximated within any constant factor. We also present results concerning the fixed parameter tractability of CoA TSS instances, and approximation algorithms for a related problem, that of TSS with partial incentives.


page 1

page 2

page 3

page 4


On Reconfigurability of Target Sets

We study the problem of deciding reconfigurability of target sets of a g...

Tree Inference: Response Time in a Binary Multinomial Processing Tree, Representation and Uniqueness of Parameters

A Multinomial Processing Tree (MPT) is a directed tree with a probabilit...

Approximating the discrete time-cost tradeoff problem with bounded depth

We revisit the deadline version of the discrete time-cost tradeoff probl...

Dynamic Monopolies in Reversible Bootstrap Percolation

We study an extremal question for the (reversible) r-bootstrap percolati...

Constant Approximation Algorithms for Guarding Simple Polygons using Vertex Guards

The art gallery problem enquires about the least number of guards suffic...

Weak dynamic monopolies in social graphs

Dynamic monopolies were already defined and studied for the formulation ...

Solving Target Set Selection with Bounded Thresholds Faster than 2^n

In this paper we consider the Target Set Selection problem. The problem ...

Please sign up or login with your details

Forgot password? Click here to reset