Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets

Anubhav Dhar, Soumita Hait, Sudeshna Kolay

The Euclidean Steiner Minimal Tree problem takes as input a set $\mathcal{P}$ of points in the Euclidean plane and finds the minimum length network interconnecting all the points of…