Fast Optimal Group Steiner Tree Search using GPUs
Summary: First GPU-tailored optimal GST solver: breaks traditional bottom-up DP into a parallel-friendly order and adds GST-specific load balancing (kernel fusion, global-memory coalescing) plus parallel-safe pruning to achieve 48–2390× speedups. Also introduces a GPU DP for diameter-bounded GSTs. (summarized by gpt-5-mini on Feb 11 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Jiayu Li (Renmin University of China)
- 2. Yahui Sun (Renmin University of China)
- 3. Bojing Ma (Renmin University of China)
- 4. Libang Chen (Renmin University of China)
- 5. Mengxi Hu (Renmin University of China)
- 6. Feng Zhang (Renmin University of China)
- 7. Rong-Hua Li (Beijing Institute of Technology)
BibTeX Citation
@inproceedings{li_sigmod26,
title = {{Fast Optimal Group Steiner Tree Search using GPUs}},
author = {Li, Jiayu and Sun, Yahui and Ma, Bojing and Chen, Libang and Hu, Mengxi and Zhang, Feng and Li, Rong-Hua},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3769792},
url = {https://dl.acm.org/doi/10.1145/3769792},
year = {2026}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,468 | GPU-Accelerated Subgraph Enumeration on Partitioned Graphs | 2020 | SIGMOD | 8.4178183e-05 |
| 3,314 | Accelerating Triangle Counting on GPU | 2021 | SIGMOD | 7.4380767e-05 |
| 4,207 | GPU-based Graph Traversal on Compressed Graphs | 2019 | SIGMOD | 6.7343908e-05 |
| 5,139 | Efficient Load-Balanced Butterfly Counting on GPU | 2022 | VLDB | 6.2579755e-05 |
| 5,531 | Efficient and Progressive Group Steiner Tree Search | 2016 | SIGMOD | 6.0935114e-05 |
| 6,249 | Self-adaptive Graph Traversal on GPUs | 2021 | SIGMOD | 5.8358127e-05 |
| 8,692 | Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights | 2021 | VLDB | 5.2905577e-05 |
| 11,775 | Approximating Probabilistic Group Steiner Trees in Graphs | 2023 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,716 | Accelerating Exact Constrained Shortest Paths on GPUs | 2021 | VLDB |
| 2 | 282 | FAST: Fast Architecture Sensitive Tree Search on Modern CPUs and GPUs | 2010 | SIGMOD |
| 3 | 10,882 | Efficient GPU-Accelerated Local Subgraph Counting | 2026 | VLDB |
| 4 | 6,151 | Efficiently Processing Joins and Grouped Aggregations on GPUs | 2025 | SIGMOD |
| 5 | 4,207 | GPU-based Graph Traversal on Compressed Graphs | 2019 | SIGMOD |
| 6 | 10,812 | A Practical Sublinear Approximation for Group Steiner Tree | 2026 | VLDB |
| 7 | 10,421 | Bound-Tightened Densest Subgraph Discovery on GPU | 2026 | SIGMOD |
| 8 | 5,411 | GTS: GPU-based Tree Index for Fast Similarity Search | 2024 | SIGMOD |
| 9 | 8,692 | Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights | 2021 | VLDB |
| 10 | 5,531 | Efficient and Progressive Group Steiner Tree Search | 2016 | SIGMOD |