Influence maximization independent of seed set size

DOI10.1016/J.ORL.2025.107309MaRDI QIDQ6892923zbMATH OpenFDO

Authors Karthik C. Lakshmanan

Publication date 27 November 2025

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2025.107309

zbMATH Keywords

approximation guaranteesinfluence maximizationseed size

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Models of societies, social and urban evolution (91D10)

Cites work

• Adaptive seeding in social networks
• Adaptive submodularity: theory and applications in active learning and stochastic optimization
• scientific article; zbMATH DE number 3904328 (Why is no real title available?)
• scientific article; zbMATH DE number 7650257 (Why is no real title available?)
• Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions
• Maximizing social influence in nearly optimal time
• New trends in influence maximization models
• On the approximability of influence in social networks

This page was built for publication: Influence maximization independent of seed set size

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