Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights
Summary: Extends group Steiner tree algorithms to graphs with both vertex and edge weights, addressing a gap in prior work. Introduces scalable |Γ|-1 and tunable |Γ|-h+1 approximation algorithms, empirically outperforming existing methods. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yahui Sun (National University of Singapore)
- 2. Xiaokui Xiao (National University of Singapore)
- 3. Bin Cui (Peking University)
- 4. Saman Halgamuge (University of Melbourne)
- 5. Theodoros Lappas (Stevens Institute of Technology)
- 6. Jun Luo (Nanyang Technological University)
BibTeX Citation
@article{sun_vldb21,
title = {{Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights}},
author = {Sun, Yahui and Xiao, Xiaokui and Cui, Bin and Halgamuge, Saman and Lappas, Theodoros and Luo, Jun},
journal = {PVLDB},
series = {{VLDB} '21},
volume = {14},
number = {7},
pages = {1137--1149},
doi = {10.14778/3450980.3450982},
url = {https://doi.org/10.14778/3450980.3450982},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 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 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,906 | EASE: An Effective 3-in-1 Keyword Search Method for Unstructured, Semi-structured and Structured Data | 2008 | SIGMOD | 9.3981082e-05 |
| 5,531 | Efficient and Progressive Group Steiner Tree Search | 2016 | SIGMOD | 6.0935114e-05 |
| 12,127 | Hunting Multiple Bumps in Graphs | 2020 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,662 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 2 | 9,571 | Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs | 2024 | VLDB |
| 3 | 11,112 | Minimum Spanning Tree Maintenance in Dynamic Graphs | 2025 | SIGMOD |
| 4 | 12,127 | Hunting Multiple Bumps in Graphs | 2020 | VLDB |
| 5 | 3,328 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | 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 | 10,812 | A Practical Sublinear Approximation for Group Steiner Tree | 2026 | VLDB |
| 10 | 11,775 | Approximating Probabilistic Group Steiner Trees in Graphs | 2023 | VLDB |