Large-scale influence maximization via maximal covering location

DOI10.1016/J.EJOR.2020.06.028zbMath1487.91096OpenAlexW3037635596MaRDI QIDQ2028806

Markus Leitner, Markus Sinnl, Mario Ruthmair, Evren Güney

Publication date: 3 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1871.1/5c2eddbe-a7b6-4188-b05c-7ff6398b2648

zbMATH Keywords

stochastic programminginteger programmingnetworkslarge scale optimizationinfluence maximization

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Stochastic programming (90C15) Discrete location and assignment (90B80)

Related Items (10)

Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem ⋮ Benders decomposition for a period-aggregated resource leveling problem with variable job duration ⋮ Improved approximation algorithms for \(k\)-submodular maximization under a knapsack constraint ⋮ An exact method for influence maximization based on deterministic linear threshold model ⋮ Efficient presolving methods for the influence maximization problem ⋮ Efficient presolving methods for solving maximal covering and partial set covering location problems ⋮ Math‐based reinforcement learning for the adaptive budgeted influence maximization problem ⋮ Accelerated Benders decomposition and local branching for dynamic maximum covering location problems ⋮ Benders decomposition algorithms for minimizing the spread of harmful contagions in networks ⋮ Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty
• Benders decomposition without separability: a computational study for capacitated facility location problems
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• Least cost influence propagation in (social) networks
• Benders decomposition for very large scale partial set covering and maximal covering location problems
• A two-stage stochastic programming approach for influence maximization in social networks
• The Benders decomposition algorithm: a literature review
• Optimization of stochastic virus detection in contact networks
• An efficient linear programming based method for the influence maximization problem in social networks
• Submodularity of Influence in Social Networks: From Local to Global
• Emergence of Scaling in Random Networks
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• An analysis of approximations for maximizing submodular set functions—I
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Large-scale influence maximization via maximal covering location