Redirigiendo al acceso original de articulo en 18 segundos...
Inicio  /  Algorithms  /  Vol: 13 Par: 2 (2020)  /  Artículo
ARTÍCULO
TITULO

Latency-Bounded Target Set Selection in Signed Networks

Miriam Di Ianni and Giovanna Varricchio    

Resumen

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.

 Artículos similares

       
 
Tienan Li, Fang Ma, Jun Wang, Pengpeng Qiu, Ning Zhang, Weiwei Guo, Jinzhong Xu and Taoyan Dai    
In order to identify the effects of the slope and precipitation intensity on the soil runoff depth and runoff rate, different tillage patterns (slope-ridge direction, horizontal slope-ridge direction, no-ridge farming) and different slopes (3° and 5°) we... ver más
Revista: Water

 
Andrei V. Panteleev and Anna A. Kolessa    
A new bio-inspired method for optimizing the objective function on a parallelepiped set of admissible solutions is proposed. It uses a model of the behavior of tomtits during the search for food. This algorithm combines some techniques for finding the ex... ver más
Revista: Algorithms

 
Mario D?Acunto, Davide Moroni, Alessandro Puntoni and Ovidio Salvetti    
The real-time environmental surveillance of large areas requires the ability to dislocate sensor networks. Generally, the probability of the occurrence of a pollution event depends on the burden of possible sources operating in the areas to be monitored.... ver más

 
Valery Sizikov, Aleksandra Dovgan and Aleksei Lavrov    
In this work, the problem of eliminating a nonuniform rectilinear smearing of an image is considered, using a mathematical- and computer-based approach. An example of such a problem is a picture of several cars, moving with different speeds, taken with a... ver más
Revista: Computers

 
Nikolaus Nova Parulian, Tiffany Lu, Shubhanshu Mishra, Mihai Avram and Jana Diesner    
Observed social networks are often considered as proxies for underlying social networks. The analysis of observed networks oftentimes involves the identification of influential nodes via various centrality measures. This paper brings insights from resear... ver más
Revista: Information