Full minimal Steiner trees on lattice sets (Q1356020): Difference between revisions

Given a finite set of points in Euclidean plane, the Steiner tree problem is to find a shortest network interconnecting the points in the set. The authors determine the Steiner minimum tree for \(n\times n\) integer lattice points. This solves an open problem posed by \textit{F. Chung}, \textit{M. Gardner} and \textit{R. Graham} [Math. Mag. 62, No. 2, 83-96 (1989; Zbl 0681.05018)].