Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Bounded Degree Group Steiner Tree Problems   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$-Tree problem we are given a set $R$ of
terminals and an integer $k$, and $T$ should contain at least $k$ terminals.
  We show that if the former problem admits approximation ratio $\rho$ then the
later problem admits approximation ratio $\rho \cdot O(\log k)$. For bounded
treewidth graphs, we obtain approximation ratio $O(\log^3 n)$ for Min-Degree
Group Steiner Tree.
  In the more general Bounded Degree Group Steiner Tree problem we are also
given edge costs and degree bounds $\{b(v):v \in V\}$, and $T$ should obey the
degree constraints $deg_T(v) \leq b(v)$ for all $v \in V$. We give a bicriteria
$(O(\log N \log |{\cal S}|),O(\log^2 n))$-approximation algorithm for this
problem on tree inputs, where $N$ is the size of the largest group,
generalizing the approximation of Garg, Konjevod, and Ravi for the case without
degree bounds.

9
The categories of this paper are: nlin
29
The categories of this paper are: funct-an
7
The categories of this paper are: hep-th
10
The categories of this paper are: q-bio
28
The categories of this paper are: alg-geom
27
The categories of this paper are: comp-gas
15
The categories of this paper are: nucl-ex
11
The categories of this paper are: hep-lat
26
The categories of this paper are: bayes-an
34
The categories of this paper are: chem-ph
22
The categories of this paper are: chao-dyn
31
The categories of this paper are: ao-sci
14
The categories of this paper are: math-ph
36
The categories of this paper are: cmp-lg
18
The categories of this paper are: econ
17
The categories of this paper are: q-fin