An efficient linear programming based method for the influence maximization problem in social networks

DOI10.1016/j.ins.2019.07.043zbMath1457.91306OpenAlexW2956633086WikidataQ127541062 ScholiaQ127541062MaRDI QIDQ2224940

Evren Güney

Publication date: 4 February 2021

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2019.07.043

zbMATH Keywords

stochastic optimizationinfluence maximizationsample average approximationpipage method

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Linear programming (90C05)

Related Items (6)

Modeling the spread of infectious diseases through influence maximization ⋮ Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem ⋮ Influence maximization algorithm based on Gaussian propagation model ⋮ An exact method for influence maximization based on deterministic linear threshold model ⋮ Efficient presolving methods for the influence maximization problem ⋮ Large-scale influence maximization via maximal covering location

Uses Software

• SUTIL

Cites Work

• Unnamed Item
• A branch and bound method for stochastic global optimization
• Optimization of stochastic virus detection in contact networks
• Pipage rounding: a new method of constructing algorithms with proven performance guarantee
• Efficient and effective influence maximization in social networks: a hybrid-approach
• The empirical behavior of sampling methods for stochastic programming
• The Sample Average Approximation Method for Stochastic Discrete Optimization
• An analysis of approximations for maximizing submodular set functions—I
• Maximizing Social Influence in Nearly Optimal Time

This page was built for publication: An efficient linear programming based method for the influence maximization problem in social networks