Efficient Algorithm for Budgeted Adaptive Influence Maximization: An Incremental RR-set Update Approach
Summary: Adaptive BIM with cost-aware greedy or a single influential node achieves an expected approximation under budget. Incremental RR-set updates keep extra info to fix RR-sets, enabling reuse and scalable diffusion; experiments show better influence and faster runtime. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Qintian Guo (Chinese University of Hong Kong)
- 2. Chen Feng (Chinese University of Hong Kong)
- 3. Fangyuan Zhang (Chinese University of Hong Kong)
- 4. Sibo Wang (Chinese University of Hong Kong)
BibTeX Citation
@inproceedings{guo_sigmod23,
title = {{Efficient Algorithm for Budgeted Adaptive Influence Maximization: An Incremental RR-set Update Approach}},
author = {Guo, Qintian and Feng, Chen and Zhang, Fangyuan and Wang, Sibo},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3617328},
url = {https://dl.acm.org/doi/10.1145/3617328},
year = {2023}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,913 | Efficient Approximation Algorithms for Minimum Cost Seed Selection with Probabilistic Coverage Guarantee | 2024 | SIGMOD | 5.3483178e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 14 of 14 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,725 | Efficient Location-Aware Influence Maximization | 2014 | SIGMOD |
| 2 | 6,415 | Influence Maximization in Real-World Closed Social Networks | 2023 | VLDB |
| 3 | 315 | Influence Maximization in Near-Linear Time: A Martingale Approach | 2015 | SIGMOD |
| 4 | 5,920 | Efficient Approximation Algorithms for Adaptive Seed Minimization | 2019 | SIGMOD |
| 5 | 194 | Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency | 2014 | SIGMOD |
| 6 | 9,057 | Efficient Influence Minimization via Node Blocking | 2024 | VLDB |
| 7 | 7,963 | Coarsening Massive Influence Networks for Scalable Diffusion Analysis | 2017 | SIGMOD |
| 8 | 4,804 | Efficient Algorithms for Adaptive Influence Maximization | 2018 | VLDB |
| 9 | 2,320 | Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened | 2020 | SIGMOD |
| 10 | 2,752 | Efficient Algorithms for Budgeted Influence Maximization on Massive Social Networks | 2020 | VLDB |