A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks

DOI10.1007/S10878-021-00812-3zbMATH1498.90236OpenAlexW3204684126MaRDI QIDQ2168709FDOQ2168709

Authors Weidong Chen, Hao Zhong, Lidong Wu, Du Ding-Zhu

Publication date 26 August 2022

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-021-00812-3

zbMATH Keywords

social networksubmodular functiongreedy approximationpositive influence dominating set

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30)

Recommendations

• On positive influence dominating sets in social networks
• Approximation algorithm for partial positive influence problem in social network
• A unified greedy approximation for several dominating set problems
• On the approximability of positive influence dominating set in social networks
• An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks

Cites work

• scientific article; zbMATH DE number 5764849 (Why is no real title available?)
• An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
• An analysis of the greedy algorithm for the submodular set covering problem
• Greedy approximations for minimum submodular cover with submodular cost
• Multi-scale attributed node embedding
• On positive influence dominating sets in social networks
• On the approximability of positive influence dominating set in social networks
• Positive Influence Dominating Set in Online Social Networks

Cited in

(9)

• An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
• An efficient local search algorithm for minimum positive influence dominating set problem
• scientific article; zbMATH DE number 6501009 (Why is no real title available?)
• On positive influence dominating sets in social networks
• On the approximability of positive influence dominating set in social networks
• Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem
• Approximation algorithm for partial positive influence problem in social network
• Pervasive domination
• A unified greedy approximation for several dominating set problems

This page was built for publication: A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168709)