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ženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on computational social systems Ročník 12; číslo 5; s. 2930 - 2939
Hlavní autoři:	Zhong, Hao, Li, Weisheng, Zhang, Qi, Lin, Ronghua, Tang, Yong
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Piscataway IEEE 01.10.2025 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!