1 paper · 1 filter
Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov +2
In the Euclidean Bottleneck Steiner Tree problem, the input consists of a set of n points in R2 called terminals and a parameter k, and the goal is to compute a Ste…