Back to papers
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)
- Paper ID
- 6711
- Venue
- SIGMOD
- Year
- 2023
- Pagerank
- 4.1945683e-05
- Overall Rank
- 11,208 | 22.03%
- DOI
-
10.1145/3617328
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
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.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 180 |
Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency |
2014 |
SIGMOD |
0.00037135181 |
| 337 |
Influence Maximization in Near-Linear Time: A Martingale Approach |
2015 |
SIGMOD |
0.00027011645 |
| 1,801 |
Online Processing Algorithms for Influence Maximization |
2018 |
SIGMOD |
0.00010510943 |
| 2,220 |
Holistic Influence Maximization: Combining Scalability and Efficiency with Opinion-Aware Models |
2016 |
SIGMOD |
9.2622402e-05 |
| 2,486 |
Efficient Algorithms for Budgeted Influence Maximization on Massive Social Networks |
2020 |
VLDB |
8.6741469e-05 |
| 2,664 |
Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened |
2020 |
SIGMOD |
8.3512717e-05 |
| 4,220 |
Revisiting the Stop-and-Stare Algorithms for Influence Maximization |
2017 |
VLDB |
6.3493792e-05 |
| 5,083 |
Revenue Maximization in Incentivized Social Advertising |
2017 |
VLDB |
5.7108274e-05 |
| 5,090 |
Efficient Algorithms for Adaptive Influence Maximization |
2018 |
VLDB |
5.7042676e-05 |
| 5,170 |
Pricing Influential Nodes in Online Social Networks |
2020 |
VLDB |
5.6471109e-05 |
| 6,086 |
Continuous Influence Maximization: What Discounts Should We Offer to Social Network Users? |
2016 |
SIGMOD |
5.21857e-05 |
| 6,179 |
Efficient Approximation Algorithms for Adaptive Seed Minimization |
2019 |
SIGMOD |
5.1691599e-05 |
| 7,988 |
Minimizing the Regret of an Influence Provider |
2021 |
SIGMOD |
4.6128031e-05 |
| 8,591 |
Maximizing Social Welfare in a Competitive Diffusion Model |
2021 |
VLDB |
4.4896282e-05 |
Semantically Similar Papers