On Steiner Trees of the Regular Simplex

Henry Fleischmann, Guillermo A. Gamboa Q., Karthik C. S. +2

In the Euclidean Steiner Tree problem, we are given as input a set of points (called terminals) in the ${\ell }_2$-metric space and the goal is to find the minimum-cost tree connectin…