Efficient presolving methods for the influence maximization problem

DOI10.1002/net.22161zbMath1530.91479arXiv2101.00393OpenAlexW4383102427MaRDI QIDQ6139380

Jianhua Yuan, Yu-Hong Dai, Shengjie Chen, Unnamed Author, Wei-Kun Chen

Publication date: 18 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.00393

zbMATH Keywords

stochastic programminginteger programmingBenders decompositioninfluence maximizationpresolving methods

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Integer programming (90C10) Stochastic programming (90C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using dual presolving reductions to reformulate cumulative constraints
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• A strong-connectivity algorithm and its applications in data flow analysis
• COBRA: A new formulation of the classic \(p\)-median location problem
• Human sexual contact network as a bipartite graph
• The average connectivity of a graph
• Least cost influence propagation in (social) networks
• A two-stage stochastic programming approach for influence maximization in social networks
• Large-scale influence maximization via maximal covering location
• Improving connectivity of compromised digital networks via algebraic connectivity maximisation
• An efficient linear programming based method for the influence maximization problem in social networks
• Bootstrap percolation in directed inhomogeneous random graphs
• Monotonic Optimization: Problems and Solution Approaches
• The Sample Average Approximation Method for Stochastic Discrete Optimization
• Exact approaches to the single-source network loading problem
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Least-Cost Influence Maximization on Social Networks
• Presolve Reductions in Mixed Integer Programming
• Probabilistic Partial Set Covering with an Oracle for Chance Constraints
• Connectivity of a general class of inhomogeneous random digraphs

This page was built for publication: Efficient presolving methods for the influence maximization problem