Better bounds on the adaptivity gap of influence maximization under full-adoption feedback
- 1 March 2023
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 318
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- European Social Fund Plus (2014-20)
- European Commission
- Ministero dell’Istruzione, dell’Università e della Ricerca (2017R9FHSR_002)
This publication has 15 references indexed in Scilit:
- Efficient approximation algorithms for adaptive influence maximizationThe VLDB Journal, 2020
- Efficient algorithms for adaptive influence maximizationProceedings of the VLDB Endowment, 2018
- Influence Maximization on Social Graphs: A SurveyIEEE Transactions on Knowledge and Data Engineering, 2018
- Influence maximization through adaptive seedingACM SIGecom Exchanges, 2016
- Maximizing Stochastic Monotone Submodular FunctionsManagement Science, 2016
- Adaptive Influence Maximization in Dynamic Social NetworksIEEE/ACM Transactions on Networking, 2016
- Solution of Bharathi–Kempe–Salek conjecture for influence maximization on arborescenceJournal of Combinatorial Optimization, 2016
- Epidemic processes in complex networksReviews of Modern Physics, 2015
- Maximizing a Monotone Submodular Function Subject to a Matroid ConstraintSIAM Journal on Computing, 2011
- Emergence of Scaling in Random NetworksScience, 1999