Research map / Learning theory and algorithms / Submodular and game algorithms
Adaptive Greedy versus Non-Adaptive Greedy for Influence Maximization
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Adaptive Influence Maximization with Myopic Feedback (NeurIPS 2019 · similarity 0.93)
- Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback (AAAI 2021 · similarity 0.93)
- REM: A Scalable Reinforced Multi-Expert Framework for Multiplex Influence Maximization (AAAI 2025 · similarity 0.88)
- Hyperparametric Robust and Dynamic Influence Maximization (AAAI 2025 · similarity 0.87)
- Motif-oriented influence maximization for viral marketing in large-scale social networks (NeurIPS 2024 · similarity 0.87)
- Graph Bayesian Optimization for Multiplex Influence Maximization (AAAI 2024 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.