A Practical Sublinear Approximation for Group Steiner Tree
Summary: MonoGST+ delivers a practical sublinear-approximation algorithm for Group Steiner Tree without sacrificing the runtime of linear-approximation solvers. A suspendable 2-star-to-set-cover reduction plus monotonicity/unimodality pruning makes it scalable on real graphs. (summarized by gpt-5.6-luna on Aug 28 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yuxuan Yang (Nanjing University)
- 2. Sirui Chen (Nanjing University)
- 3. Zhuolin He (Nanjing University)
- 4. Gong Cheng (Nanjing University)
BibTeX Citation
@article{yang_vldb26,
title = {{A Practical Sublinear Approximation for Group Steiner Tree}},
author = {Yang, Yuxuan and Chen, Sirui and He, Zhuolin and Cheng, Gong},
journal = {PVLDB},
series = {{VLDB} '26},
volume = {19},
number = {10},
pages = {2630--2642},
doi = {10.14778/3828612.3828620},
url = {https://doi.org/10.14778/3828612.3828620},
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 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 197 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00025584127 |
| 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,501 | Keyword Search in Databases: The Power of RDBMS | 2009 | SIGMOD | 0.00010461358 |
| 5,531 | Efficient and Progressive Group Steiner Tree Search | 2016 | SIGMOD | 6.0935114e-05 |
| 8,692 | Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights | 2021 | VLDB | 5.2905577e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,328 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD |
| 2 | 9,721 | Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation | 2025 | PODS |
| 3 | 11,830 | Linear-Delay Enumeration for Minimal Steiner Problems | 2022 | PODS |
| 4 | 12,127 | Hunting Multiple Bumps in Graphs | 2020 | VLDB |
| 5 | 11,112 | Minimum Spanning Tree Maintenance in Dynamic Graphs | 2025 | SIGMOD |
| 6 | 5,150 | Minimum Spanning Trees in Temporal Graphs | 2015 | SIGMOD |
| 7 | 10,568 | Fast Optimal Group Steiner Tree Search using GPUs | 2026 | SIGMOD |
| 8 | 5,531 | Efficient and Progressive Group Steiner Tree Search | 2016 | SIGMOD |
| 9 | 11,775 | Approximating Probabilistic Group Steiner Trees in Graphs | 2023 | VLDB |
| 10 | 8,692 | Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights | 2021 | VLDB |