Influence maximization problem: properties and algorithms

DOI10.1007/s10878-020-00638-5zbMath1467.90057OpenAlexW3081437886MaRDI QIDQ830929

Yapu Zhang, Wenguo Yang, Ding-Zhu Du

Publication date: 10 May 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00638-5

zbMATH Keywords

approximation algorithmsubmodular functionmarginal increment

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Novel algorithms for maximum DS decomposition, Nonsubmodular constrained profit maximization from increment perspective

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New dominating sets in social networks
• Constrained Monotone Function Maximization and the Supermodular Degree
• Welfare maximization and the supermodular degree
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• An analysis of approximations for maximizing submodular set functions—I
• Discrete Convex Analysis
• Maximizing Social Influence in Nearly Optimal Time