Efficient Approximation Algorithms for Several Positive Influence Dominating Set Problems in Social Networks

Identifying positive influence dominating set (PIDS) with the smallest cardinality can produce positive effect with the minimal cost on a social network. The purpose of this article is to propose new approximation algorithms for the minimum PIDS problem and its variants such as the minimum connected...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on computational social systems Vol. 12; no. 5; pp. 2930 - 2939
Main Authors:	Zhong, Hao, Li, Weisheng, Zhang, Qi, Lin, Ronghua, Tang, Yong
Format:	Journal Article
Language:	English
Published:	Piscataway IEEE 01.10.2025 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Approximation Approximation algorithm Approximation algorithms connected positive influence dominating set (CPIDS) Costs Drugs Electronic mail Heuristic algorithms Multiplexing positive influence dominating set (PIDS) Social networking (online) Social networks submodular function Technological innovation Time complexity Training
ISSN:	2329-924X, 2373-7476
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!