Next Article in Journal
GA-Adaptive Template Matching for Offline Shape Motion Tracking Based on Edge Detection: IAS Estimation from the SURVISHNO 2019 Challenge Video for Machine Diagnostics Purposes
Previous Article in Journal / Special Issue
Constrained Connectivity in Bounded X-Width Multi-Interface Networks
Open AccessArticle

Latency-bounded Target Set Selection in Signed Networks

1
Dipartimento di Matematica, Università degli Studi di Roma "Tor Vergata", 00133 Roma, RM, Italy
2
Gran Sasso Science Institute, 67100 L’Aquila, Italy
*
Author to whom correspondence should be addressed.
Algorithms 2020, 13(2), 32; https://doi.org/10.3390/a13020032
Received: 22 December 2019 / Revised: 27 January 2020 / Accepted: 27 January 2020 / Published: 29 January 2020
(This article belongs to the Special Issue Approximation Algorithms for NP-Hard Problems)
It is well-documented that social networks play a considerable role in information spreading. The dynamic processes governing the diffusion of information have been studied in many fields, including epidemiology, sociology, economics, and computer science. A widely studied problem in the area of viral marketing is the target set selection: in order to market a new product, hoping it will be adopted by a large fraction of individuals in the network, which set of individuals should we “target” (for instance, by offering them free samples of the product)? In this paper, we introduce a diffusion model in which some of the neighbors of a node have a negative influence on that node, namely, they induce the node to reject the feature that is supposed to be spread. We study the target set selection problem within this model, first proving a strong inapproximability result holding also when the diffusion process is required to reach all the nodes in a couple of rounds. Then, we consider a set of restrictions under which the problem is approximable to some extent.
Keywords: social networks; network analysis; diffusion processes; approximation social networks; network analysis; diffusion processes; approximation
MDPI and ACS Style

Di Ianni, M.; Varricchio, G. Latency-bounded Target Set Selection in Signed Networks. Algorithms 2020, 13, 32.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop