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

DOI10.1007/S10878-021-00812-3zbMATH Open1498.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

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

zbMATH Keywords

social networksubmodular functiongreedy approximationpositive influence dominating set

Mathematics Subject Classification ID

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

Cites Work

• An analysis of the greedy algorithm for the submodular set covering problem
• Title not available (Why is that?)
• On the approximability of positive influence dominating set in social networks
• Positive Influence Dominating Set in Online Social Networks
• On positive influence dominating sets in social networks
• Greedy approximations for minimum submodular cover with submodular cost
• Multi-Scale attributed node embedding
• An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks

Cited In (6)

• On the approximability of positive influence dominating set in social networks
• A unified greedy approximation for several dominating set problems
• An efficient local search algorithm for minimum positive influence dominating set problem
• Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem
• Title not available (Why is that?)
• On positive influence dominating sets in social networks

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)