Viser treff 1-1 av 1

• #### Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree ﻿

(Peer reviewed; Journal article, 2019)
In the Steiner Tree problem, we are given as input a connected $n$-vertex graph with edge weights in $\{1,2,\ldots,W\}$, and a set of $k$ terminal vertices. Our task is to compute a minimum-weight tree that contains ...