3 citations · 7 across the 10 of their papers we have counts for
1 paper · 2 filters
Bart M. P. Jansen, Céline M. F. Swennenhuis
In the Steiner Tree problem we are given an undirected edge-weighted graph as input, along with a set K of vertices called terminals. The task is to output a minimum-weight conne…