Profit maximization for competitive influence spread in social networks

DOI10.1007/978-3-031-49193-1_28MaRDI QIDQ6591656

Yun Bai, Zhongzheng Tang, Qiufen Ni

Publication date: 22 August 2024

zbMATH Keywords

social networkprofit maximization\(k\)-submodular

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• A note on maximizing a submodular set function subject to a knapsack constraint
• Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms
• A random algorithm for profit maximization in online social networks
• Constrained submodular maximization via greedy local search
• On maximizing a monotone \(k\)-submodular function under a knapsack constraint
• Towards Minimizing k-Submodular Functions
• Maximizing k -Submodular Functions and Beyond
• Targeted influence maximization in competitive social networks
• An improved analysis of the Greedy+Singleton algorithm for \(k\)-submodular knapsack maximization

This page was built for publication: Profit maximization for competitive influence spread in social networks