Efficient and Progressive Group Steiner Tree Search
Summary: Proposes PrunedDP for GST using optimal-tree decomposition and conditional-tree merging to prune DP search. With progressive A*-search and tight bounds, it yields refinements, huge speedups and lower memory, often locating optimal GST solutions. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Rong-Hua Li
- 2. Lu Qin
- 3. Jeffrey Xu Yu
- 4. Rui Mao
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,750 | Full-Power Graph Querying: State of the Art and Challenges | 2023 | VLDB | 4.456315e-05 |
| 10,079 | Fast Optimal Group Steiner Tree Search using GPUs | 2026 | SIGMOD | 4.1945683e-05 |
| 11,264 | Approximating Probabilistic Group Steiner Trees in Graphs | 2023 | VLDB | 4.1945683e-05 |
| 11,493 | Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights | 2021 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7 | Optimal Aggregation Algorithms for Middleware [Extended Abstract] | 2001 | PODS | 0.0015496097 |
| 301 | BLINKS: Ranked Keyword Searches on Graphs | 2007 | SIGMOD | 0.00028370644 |
| 336 | Bidirectional Expansion For Keyword Search on Graph Databases | 2005 | VLDB | 0.00027020919 |
| 1,073 | Finding and Approximating Top-k Answers in Keyword Proximity Search | 2006 | PODS | 0.00014264992 |
| 3,272 | Progressive Computation of the Min-Dist Optimal-Location Query | 2006 | VLDB | 7.2958583e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,854 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD | 6.6988744e-05 |
| 10,985 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD | 4.1945683e-05 |
| 6,588 | Efficient Progressive Minimum k-Core Search | 2020 | VLDB | 5.0020648e-05 |
| 11,631 | Hunting Multiple Bumps in Graphs | 2020 | VLDB | 4.1945683e-05 |
| 5,366 | Minimum Spanning Trees in Temporal Graphs | 2015 | SIGMOD | 5.5460085e-05 |
| 7,226 | Efficient Search in Very Large Databases | 1988 | VLDB | 4.7953551e-05 |
| 1,826 | Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products | 2006 | VLDB | 0.00010400425 |
| 11,264 | Approximating Probabilistic Group Steiner Trees in Graphs | 2023 | VLDB | 4.1945683e-05 |
| 11,493 | Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights | 2021 | VLDB | 4.1945683e-05 |
| 10,079 | Fast Optimal Group Steiner Tree Search using GPUs | 2026 | SIGMOD | 4.1945683e-05 |