Full minimal Steiner trees on lattice sets (Q1356020): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jcta.1996.2752 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2056026586 / rank | |||
Normal rank | |||
Revision as of 18:50, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Full minimal Steiner trees on lattice sets |
scientific article |
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
