Answers are grounded in this paper and cite their sources.
The min‐cost group Steiner tree problem ( GSTP ) is a well‐known problem in graph theory, not only being NP‐complete but also not admitting a constant‐factor approximation even under strong restrictions. Given a graph and groups of vertices in , the problem GSTP asks for a minimum‐cost subtree of that contains at least one vertex from each group. In this paper, we address two variants of the GSTP : First, we consider groups of edges rather than vertices. Perhaps surprisingly, this problem is not equivalent to the vertex group variant. For instance, in the edge version it is even NP‐complete to decide whether there exists a feasible solution. Next, we consider the restriction that all of the (vertex or edge) groups are connected. We show that these variants can be solved in polynomial time, provided both the treewidth of and the vertex frequency (the number of groups a vertex is contained in) are bounded. However, the problems remain NP‐complete when only one of these parameters is bounded. Furthermore, we give various approximation algorithms for the connected edge GSTP on trees.
No takes yet. Share an insight, caveat, or question.
Geis et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: