A faster approximation algorithm for the Steiner problem in graphs

Let $G$ be a connected graph and $S\subseteq V(G)$. Then the Steiner distance of $S$ in $G$, denoted by $d_{G}(S)$, is the smallest number of edges in a connected subgraph of $G$ that contains $S$. A connected graph $G$ is $k$-Steiner distance-...

Let $$\mathcal {H}=(V,\mathcal {E})$$H=(V,E) be a hypergraph with set of vertices $$V, n:=|V|$$V,n:=|V| and set of (hyper-)edges $$\mathcal {E}, m:=|\mathcal {E}|$$E,m:=|E|. Let $$l$$l be the maximum size of an edge, $$\varDelta $$Δ be the maximum ...

Let G be a connected graph and S@__ __V(G). Then the Steiner distance of S, denoted by d"G(S), is the smallest number of edges in a connected subgraph of G containing S. Such a subgraph is necessarily a tree called a Steiner tree for S. The Steiner ...