Database Paper Browser

Back to papers

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)

Paper ID
7389
Venue
SIGMOD
Year
2026
Pagerank
4.1905499e-05
Overall Rank
10,079 | 29.96%
DOI
10.1145/3769792

Incoming Non-self Citations Over Time

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

Authors

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
3,488 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 7.0460627e-05
4,146 Accelerating Triangle Counting on GPU 2021 SIGMOD 6.4065776e-05
4,525 GPU-based Graph Traversal on Compressed Graphs 2019 SIGMOD 6.1087614e-05
5,483 Efficient Load-Balanced Butterfly Counting on GPU 2022 VLDB 5.4829054e-05
5,697 Efficient and Progressive Group Steiner Tree Search 2016 SIGMOD 5.3672389e-05
7,226 Self-adaptive Graph Traversal on GPUs 2021 SIGMOD 4.7910164e-05
11,266 Approximating Probabilistic Group Steiner Trees in Graphs 2023 VLDB 4.1905499e-05
11,497 Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights 2021 VLDB 4.1905499e-05
Previous Page 1 / 1 Next

Semantically Similar Papers