2 citations · 2 across the 1 of their papers we have counts for
1 paper
Isaac Fung, Konstantinos Georgiou, Jochen Koenemann +1
We consider the Steiner tree problem in quasi-bipartite graphs, where no two Steiner vertices are connected by an edge. For this class of instances, we present an efficient algorit…