scholarly journals On the approximability of positive influence dominating set in social networks

2012 ◽  
Vol 27 (3) ◽  
pp. 487-503 ◽  
Author(s):  
Thang N. Dinh ◽  
Yilin Shen ◽  
Dung T. Nguyen ◽  
My T. Thai
Algorithms ◽  
2021 ◽  
Vol 14 (3) ◽  
pp. 79
Author(s):  
Salim Bouamama ◽  
Christian Blum

This paper presents a performance comparison of greedy heuristics for a recent variant of the dominating set problem known as the minimum positive influence dominating set (MPIDS) problem. This APX-hard combinatorial optimization problem has applications in social networks. Its aim is to identify a small subset of key influential individuals in order to facilitate the spread of positive influence in the whole network. In this paper, we focus on the development of a fast and effective greedy heuristic for the MPIDS problem, because greedy heuristics are an essential component of more sophisticated metaheuristics. Thus, the development of well-working greedy heuristics supports the development of efficient metaheuristics. Extensive experiments conducted on a wide range of social networks and complex networks confirm the overall superiority of our greedy algorithm over its competitors, especially when the problem size becomes large. Moreover, we compare our algorithm with the integer linear programming solver CPLEX. While the performance of CPLEX is very strong for small and medium-sized networks, it reaches its limits when being applied to the largest networks. However, even in the context of small and medium-sized networks, our greedy algorithm is only 2.53% worse than CPLEX.


2013 ◽  
Vol 10 (10) ◽  
pp. 2136-2145 ◽  
Author(s):  
Guangyuan Wang ◽  
Hua Wang ◽  
Xiaohui Tao ◽  
Ji Zhang ◽  
Guohun Zhu

Online social network has developed significantly in recent years. Most of current research has utilized the property of online social network to spread information and ideas. Motivated by the applications of dominating set in social networks (such as e-learning), a variation of the dominating set called positive influence dominating set (PIDS) has been studied in the literature. The existing research for PIDS problem do not take into consideration the attributes, directions and degrees of personal influence. However, these factors are very important for selecting a better PIDS. For example, in a real-life e-learning community, the attributes and the degrees of their influence between a tutor and a student are different; the relationship between two e-learning users is asymmetrical. Hence, comprehensive, deep investigation of user’s properties become an emerging and urgent issue. The focus of this study is on the degree and direction between e-learners’ influence. A novel dominating set model called weighted positive influence dominating set (WPIDS), and two selection algorithms for the WPIDS problem have been proposed. Experiments using synthetic data sets demonstrate that the proposed model and algorithms are more reasonable and effective than those of the positive influence dominating set (PIDS) without considering the key factors of weight, direction and so on.


2019 ◽  
Vol 6 (5) ◽  
pp. 956-967 ◽  
Author(s):  
Hongwei Du ◽  
Caiwei Yuan ◽  
He Yuan ◽  
Shanshan Wei ◽  
Wen Xu

Sign in / Sign up

Export Citation Format

Share Document