2 citations · 3 across the 4 of their papers we have counts for
1 paper · 1 filter
Radek Hušek, Dušan Knop, Tomáš Masařík
In the Steiner Tree problem we are given an edge weighted undirected graph G=(V,E) and a set of terminals R⊆V. The task is to find a connected subgraph of G conta…