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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on computational social systems Ročník 12; číslo 5; s. 2930 - 2939
Hlavní autori:	Zhong, Hao, Li, Weisheng, Zhang, Qi, Lin, Ronghua, Tang, Yong
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Piscataway IEEE 01.10.2025 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!