Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights
Summary: Group Steiner tree with vertex and edge weights; minimize total weight while hitting every vertex group (relevant to social networks and knowledge graphs). Extends two unweighted algorithms to weighted graphs, and presents (Gamma-1)-approximation variants (fast for large groups) plus a DP-based (Gamma-h+1)-approximation, with experiments showing solid gains over prior work. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yahui Sun
- 2. Xiaokui Xiao
- 3. Bin Cui
- 4. Saman Halgamuge
- 5. Theodoros Lappas
- 6. Jun Luo
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 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 |
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 |
|---|---|---|---|---|
| 2,125 | EASE: An Effective 3-in-1 Keyword Search Method for Unstructured, Semi-structured and Structured Data | 2008 | SIGMOD | 9.4893973e-05 |
| 5,683 | Efficient and Progressive Group Steiner Tree Search | 2016 | SIGMOD | 5.3723969e-05 |
| 11,631 | Hunting Multiple Bumps in Graphs | 2020 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,985 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD | 4.1945683e-05 |
| 6,207 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 5.1572428e-05 |
| 9,239 | Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs | 2024 | VLDB | 4.3690661e-05 |
| 10,383 | Minimum Spanning Tree Maintenance in Dynamic Graphs | 2025 | SIGMOD | 4.1945683e-05 |
| 11,631 | Hunting Multiple Bumps in Graphs | 2020 | VLDB | 4.1945683e-05 |
| 3,854 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD | 6.6988744e-05 |
| 5,366 | Minimum Spanning Trees in Temporal Graphs | 2015 | SIGMOD | 5.5460085e-05 |
| 10,079 | Fast Optimal Group Steiner Tree Search using GPUs | 2026 | SIGMOD | 4.1945683e-05 |
| 5,683 | Efficient and Progressive Group Steiner Tree Search | 2016 | SIGMOD | 5.3723969e-05 |
| 11,264 | Approximating Probabilistic Group Steiner Trees in Graphs | 2023 | VLDB | 4.1945683e-05 |