Efficient Algorithms for Adaptive Influence Maximization
Summary: Introduces AdaptGreedy, the first practical batch-adaptive influence-maximization algorithms with provable guarantees as seeds are selected after observing prior cascades. EPIC reduces expected approximation error, improving adaptive performance over existing non-adaptive IM subroutines in theory and experiments. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Kai Han (University of Science and Technology Beijing)
- 2. Keke Huang (Nanyang Technological University)
- 3. Xiaokui Xiao (National University of Singapore)
- 4. Jing Tang (National University of Singapore)
- 5. Aixin Sun (Nanyang Technological University)
- 6. Xueyan Tang (Nanyang Technological University)
BibTeX Citation
@article{han_vldb18,
title = {{Efficient Algorithms for Adaptive Influence Maximization}},
author = {Han, Kai and Huang, Keke and Xiao, Xiaokui and Tang, Jing and Sun, Aixin and Tang, Xueyan},
journal = {PVLDB},
series = {{VLDB} '18},
volume = {11},
number = {9},
pages = {1029--1040},
doi = {10.14778/3213880.3213883},
url = {https://doi.org/10.14778/3213880.3213883},
year = {2018}
}
Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 199 | Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency | 2014 | SIGMOD | 0.00025522558 |
| 320 | Influence Maximization in Near-Linear Time: A Martingale Approach | 2015 | SIGMOD | 0.00021143147 |
| 455 | Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks | 2016 | SIGMOD | 0.0001796092 |
| 1,474 | Online Processing Algorithms for Influence Maximization | 2018 | SIGMOD | 0.00010556999 |
| 3,554 | Revisiting the Stop-and-Stare Algorithms for Influence Maximization | 2017 | VLDB | 7.2088217e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,278 | Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened | 2020 | SIGMOD |
| 2 | 2,306 | Online Topic-Aware Influence Maximization | 2015 | VLDB |
| 3 | 4,819 | Efficient Location-Aware Influence Maximization | 2014 | SIGMOD |
| 4 | 299 | A Data-Based Approach to Social Influence Maximization | 2012 | VLDB |
| 5 | 4,054 | Real-Time Influence Maximization on Dynamic Social Streams | 2017 | VLDB |
| 6 | 199 | Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency | 2014 | SIGMOD |
| 7 | 11,723 | Efficient Algorithm for Budgeted Adaptive Influence Maximization: An Incremental RR-set Update Approach | 2023 | SIGMOD |
| 8 | 320 | Influence Maximization in Near-Linear Time: A Martingale Approach | 2015 | SIGMOD |
| 9 | 5,688 | Efficient Approximation Algorithms for Adaptive Seed Minimization | 2019 | SIGMOD |
| 10 | 2,697 | Efficient Algorithms for Budgeted Influence Maximization on Massive Social Networks | 2020 | VLDB |