Approximating Probabilistic Group Steiner Trees in Graphs

Summary: Probabilistic group Steiner tree: min-weight tree whose vertices cover each PoI with joint probability ≥ threshold (NP-hard). Three approximation algorithms: Algs 1–2 give tight |Γ|- and ξ-approx (exponential in ξ or |Γ|), Alg3 is polynomial-time with looser guarantee; outperforms prior work. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 13176
Venue: VLDB
Year: 2023
Pagerank: 4.1945683e-05
Overall Rank: 11,264 | 21.64%
DOI: 10.14778/3565816.3565834

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,079	Fast Optimal Group Steiner Tree Search using GPUs	2026	SIGMOD	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
260	Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling	2013	SIGMOD	0.00030040036
1,654	An Experimental Study on Hub Labeling based Shortest Path Algorithms	2018	VLDB	0.000109978
2,125	EASE: An Effective 3-in-1 Keyword Search Method for Unstructured, Semi-structured and Structured Data	2008	SIGMOD	9.4893973e-05
2,639	Scaling Distance Labeling on Small-World Networks	2019	SIGMOD	8.3975113e-05
3,873	Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases	2012	VLDB	6.6779082e-05
5,035	Scaling Up Distance Labeling on Graphs with Core-Periphery Properties	2020	SIGMOD	5.7470184e-05
5,683	Efficient and Progressive Group Steiner Tree Search	2016	SIGMOD	5.3723969e-05
6,576	Supporting Keyword Search in Product Database: A Probabilistic Approach	2013	VLDB	5.0046315e-05
8,765	Efficient Query Answering in Probabilistic RDF Graphs	2011	SIGMOD	4.456315e-05
11,493	Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights	2021	VLDB	4.1945683e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
3,636	Efficient and Effective Algorithms for Clustering Uncertain Graphs	2019	VLDB	6.8976555e-05
7,501	Ranked Enumeration of Minimal Triangulations	2019	PODS	4.7180617e-05
10,352	Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation	2025	PODS	4.1945683e-05
5,043	The Complexity of Mining Maximal Frequent Subgraphs	2013	PODS	5.7411631e-05
5,366	Minimum Spanning Trees in Temporal Graphs	2015	SIGMOD	5.5460085e-05
11,631	Hunting Multiple Bumps in Graphs	2020	VLDB	4.1945683e-05
9,239	Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs	2024	VLDB	4.3690661e-05
6,545	Clustering Uncertain Graphs	2018	VLDB	5.0193115e-05
5,683	Efficient and Progressive Group Steiner Tree Search	2016	SIGMOD	5.3723969e-05
11,493	Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights	2021	VLDB	4.1945683e-05