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

DOI10.1016/J.INS.2019.07.043MaRDI QIDQ2224940zbMATHOpenAlexWikidataFDO

Authors 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

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

Recommendations

• Influence Maximization in Social Networks
• An MCDM integrated adaptive simulated annealing approach for influence maximization in social networks
• Efficient and effective influence maximization in social networks: a hybrid-approach
• Least cost influence propagation in (social) networks
• Large-scale influence maximization via maximal covering location

Cites work

• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• A branch and bound method for stochastic global optimization
• An analysis of approximations for maximizing submodular set functions—I
• Efficient and effective influence maximization in social networks: a hybrid-approach
• Maximizing social influence in nearly optimal time
• Optimization of stochastic virus detection in contact networks
• Pipage rounding: a new method of constructing algorithms with proven performance guarantee
• The empirical behavior of sampling methods for stochastic programming
• The sample average approximation method for stochastic discrete optimization

Cited in

(17)

• Semantics-aware influence maximization in social networks
• A two-stage stochastic programming approach for influence maximization in social networks
• Influence maximization problem: properties and algorithms
• An improved community-based greedy algorithm for solving the influence maximization problem in social networks
• Identifying a set of key members in social networks using SDP-based stochastic search and integer programming algorithms
• Mixed integer programming and LP rounding for opinion maximization on directed acyclic graphs
• Efficient presolving methods for the influence maximization problem
• MHPD: an efficient evaluation method for influence maximization on hypergraphs
• Large-scale influence maximization via maximal covering location
• Modeling the spread of infectious diseases through influence maximization
• Influence maximization algorithm based on Gaussian propagation model
• An MCDM integrated adaptive simulated annealing approach for influence maximization in social networks
• Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem
• Influence minimization in linear threshold networks
• An \(L _{p }\) norm relaxation approach to positive influence maximization in social network under the deterministic linear threshold model
• An exact method for influence maximization based on deterministic linear threshold model
• Matching influence maximization in social networks

Describes a project that uses

Uses Software

• SUTIL

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

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