Full minimal Steiner trees on lattice sets (Q1356020)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Full minimal Steiner trees on lattice sets |
scientific article; zbMATH DE number 1016773
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Full minimal Steiner trees on lattice sets |
scientific article; zbMATH DE number 1016773 |
Statements
Full minimal Steiner trees on lattice sets (English)
0 references
9 November 1997
0 references
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)].
0 references
Steiner tree
0 references
lattice points
0 references
0.91451234
0 references
0.9116614
0 references
0 references
0.90197694
0 references
0.9016264
0 references
0.90132797
0 references
0.89736694
0 references
0 references
