Fully Dynamic Algorithms for Euclidean Steiner Tree

T-H. Hubert Chan, Gramoz Goranci, Shaofeng H. -C. Jiang +2

The Euclidean Steiner tree problem asks to find a min-cost metric graph that connects a given set of \emph{terminal} points $X$ in ${\mathbb{R}}^d$, possibly using points not in $X$…