# Bounded Degree Group Steiner Tree Problems

IWOCA, pp. 343-354, 2019.

EI

Abstract:

We study two problems that seek a subtree $T$ of a graph $G=(V,E)$ such that $T$ satisfies a certain property and has minimal maximum degree. - In the Min-Degree Group Steiner Tree problem we are given a collection ${\cal S}$ of groups (subsets of $V$) and $T$ should contain a node from every group. - In the Min-Degree Steiner $k$-T...More

Code:

Data: