Highly Influenced

# An exact almost optimal algorithm for target set selection in social networks

@inproceedings{BenZwi2009AnEA, title={An exact almost optimal algorithm for target set selection in social networks}, author={Oren Ben-Zwi and Danny Hermelin and Daniel Lokshtanov and Ilan Newman}, booktitle={EC}, year={2009} }

- Published 2009 in EC
DOI:10.1145/1566374.1566424

The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicine. Its input is a graph with vertex thresholds, the social network, and the goal is to find a subset of vertices, the target set, that "activates" a prespecified number of vertices in the graph. Activation of a vertex is defined via a so-called activation process as follows: Initially, all vertices in the target set… CONTINUE READING

Highly Cited

This paper has 40 citations. REVIEW CITATIONS

#### 1 Figure or Table

#### Topics

#### Statistics

Citations per Year

#### Citation Velocity: 5

Averaging **5 citations** per year over the last 3 years.

**FAQ**.