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 (Shenzhen University)
- 2. Lu Qin (University of Technology Sydney)
- 3. Jeffrey Xu Yu (Chinese University of Hong Kong)
- 4. Rui Mao (Shenzhen University)
BibTeX Citation
@inproceedings{li_sigmod16,
title = {{Efficient and Progressive Group Steiner Tree Search}},
author = {Li, Rong-Hua and Qin, Lu and Yu, Jeffrey Xu and Mao, Rui},
series = {{SIGMOD} '16},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2882903.2915217},
url = {https://dl.acm.org/doi/10.1145/2882903.2915217},
year = {2016}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,180 | Full-Power Graph Querying: State of the Art and Challenges | 2023 | VLDB | 5.3820899e-05 |
| 8,692 | Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights | 2021 | VLDB | 5.2905577e-05 |
| 10,568 | Fast Optimal Group Steiner Tree Search using GPUs | 2026 | SIGMOD | 4.9793485e-05 |
| 10,812 | A Practical Sublinear Approximation for Group Steiner Tree | 2026 | VLDB | 4.9793485e-05 |
| 11,775 | Approximating Probabilistic Group Steiner Trees in Graphs | 2023 | VLDB | 4.9793485e-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 |
|---|---|---|---|---|
| 5 | Optimal Aggregation Algorithms for Middleware [Extended Abstract] | 2001 | PODS | 0.0010679641 |
| 270 | BLINKS: Ranked Keyword Searches on Graphs | 2007 | SIGMOD | 0.00022599109 |
| 293 | Bidirectional Expansion For Keyword Search on Graph Databases | 2005 | VLDB | 0.00021943678 |
| 1,445 | Finding and Approximating Top-k Answers in Keyword Proximity Search | 2006 | PODS | 0.0001063035 |
| 3,439 | Progressive Computation of the Min-Dist Optimal-Location Query | 2006 | VLDB | 7.2994607e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,540 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |
| 2 | 6,466 | Efficient Progressive Minimum k-Core Search | 2020 | VLDB |
| 3 | 12,127 | Hunting Multiple Bumps in Graphs | 2020 | VLDB |
| 4 | 5,150 | Minimum Spanning Trees in Temporal Graphs | 2015 | SIGMOD |
| 5 | 7,355 | Efficient Search in Very Large Databases | 1988 | VLDB |
| 6 | 1,301 | Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products | 2006 | VLDB |
| 7 | 11,775 | Approximating Probabilistic Group Steiner Trees in Graphs | 2023 | VLDB |
| 8 | 10,812 | A Practical Sublinear Approximation for Group Steiner Tree | 2026 | VLDB |
| 9 | 8,692 | Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights | 2021 | VLDB |
| 10 | 10,568 | Fast Optimal Group Steiner Tree Search using GPUs | 2026 | SIGMOD |