Efficient GPU-Accelerated Adaptive Minimum Cost Seed Selection

Summary: GAAS accelerates adaptive minimum-cost seed selection on GPUs via GmRR, a contention-avoiding circular mRR-set layout and balanced kernels. Reusing and theoretically updating mRR-sets yields up to 68.9× speedups with competitive seed costs. (summarized by gpt-5.6-luna on Aug 28 2026)

Paper ID: h4187f3767c9b86af
Venue: VLDB
Year: 2026
Pagerank: 4.9769913e-05
Overall Rank: 10,880 | 26.88%
DOI: 10.14778/3836663.3836699
PDF: Download (CC BY-NC-ND 4.0)

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Gongyao Guo (Hong Kong Polytechnic University)
2. Chen Feng (Hong Kong Polytechnic University)
3. Yiran Li (University of Toronto)
4. Jieming Shi (Hong Kong Polytechnic University)

BibTeX Citation

@article{guo_vldb26,
        title = {{Efficient GPU-Accelerated Adaptive Minimum Cost Seed Selection}},
        author = {Guo, Gongyao and Feng, Chen and Li, Yiran and Shi, Jieming},
        journal = {PVLDB},
        series = {{VLDB} '26},
        volume = {19},
        number = {11},
        pages = {3427--3439},
        doi = {10.14778/3836663.3836699},
        url = {https://doi.org/10.14778/3836663.3836699},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 21 of 21 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.00025510476
320	Influence Maximization in Near-Linear Time: A Martingale Approach	2015	SIGMOD	0.00021133139
455	Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks	2016	SIGMOD	0.00017952418
1,474	Online Processing Algorithms for Influence Maximization	2018	SIGMOD	0.00010552001
2,280	Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened	2020	SIGMOD	8.7029683e-05
2,698	Efficient Algorithms for Budgeted Influence Maximization on Massive Social Networks	2020	VLDB	8.1163992e-05
2,789	iBFS: Concurrent Breadth-First Search on GPUs	2016	SIGMOD	8.0078111e-05
3,556	Revisiting the Stop-and-Stare Algorithms for Influence Maximization	2017	VLDB	7.2054091e-05
3,655	Realtime Top-k Personalized PageRank over Large Graphs on GPUs	2020	VLDB	7.1254436e-05
4,655	Efficient Algorithms for Adaptive Influence Maximization	2018	VLDB	6.482094e-05
5,141	Efficient Load-Balanced Butterfly Counting on GPU	2022	VLDB	6.2550131e-05
5,688	Efficient Approximation Algorithms for Adaptive Seed Minimization	2019	SIGMOD	6.0327812e-05
8,503	Efficient Influence Minimization via Node Blocking	2024	VLDB	5.3276429e-05
8,610	Scapin: Scalable Graph Structure Perturbation by Augmented Influence Maximization	2023	SIGMOD	5.30241e-05
8,804	GPH: An Efficient and Effective Perfect Hashing Scheme for GPU Architectures	2025	SIGMOD	5.27236e-05
9,085	Efficient Approximation Algorithms for Minimum Cost Seed Selection with Probabilistic Coverage Guarantee	2024	SIGMOD	5.2258409e-05
9,960	Efficient and Effective Algorithms for A Family of Influence Maximization Problems with A Matroid Constraint	2025	VLDB	5.1014161e-05
9,963	Towards Sufficient GPU-accelerated Dynamic Graph Management: Survey and Experiment	2025	VLDB	5.1014161e-05
9,967	Everest: GPU-Accelerated System For Mining Temporal Motifs	2024	VLDB	5.1014161e-05
9,969	Fast and Space-Efficient Parallel Algorithms for Influence Maximization	2024	VLDB	5.1014161e-05
11,729	Efficient Algorithm for Budgeted Adaptive Influence Maximization: An Incremental RR-set Update Approach	2023	SIGMOD	4.9769913e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	10,579	Fast Optimal Group Steiner Tree Search using GPUs	2026	SIGMOD
2	4,055	Real-Time Influence Maximization on Dynamic Social Streams	2017	VLDB
3	4,655	Efficient Algorithms for Adaptive Influence Maximization	2018	VLDB
4	4,207	GPU-based Graph Traversal on Compressed Graphs	2019	SIGMOD
5	9,960	Efficient and Effective Algorithms for A Family of Influence Maximization Problems with A Matroid Constraint	2025	VLDB
6	2,698	Efficient Algorithms for Budgeted Influence Maximization on Massive Social Networks	2020	VLDB
7	9,969	Fast and Space-Efficient Parallel Algorithms for Influence Maximization	2024	VLDB
8	11,729	Efficient Algorithm for Budgeted Adaptive Influence Maximization: An Incremental RR-set Update Approach	2023	SIGMOD
9	5,688	Efficient Approximation Algorithms for Adaptive Seed Minimization	2019	SIGMOD
10	9,085	Efficient Approximation Algorithms for Minimum Cost Seed Selection with Probabilistic Coverage Guarantee	2024	SIGMOD