Minimal Steiner trees for \(2^ k \times 2^ k\) square lattices (Q1906121)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 842832
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal Steiner trees for \(2^ k \times 2^ k\) square lattices |
scientific article; zbMATH DE number 842832 |
Statements
Minimal Steiner trees for \(2^ k \times 2^ k\) square lattices (English)
0 references
13 May 1996
0 references
The authors prove a conjecture of Chung, Graham, and Gardner, giving the form of the minimal Steiner trees for the set of points comprising the vertices of a \(2^k\times 2^k\) square lattice. The basic building block of these trees is the minimal Steiner tree of the vertices of a (unit) square.
0 references
minimal Steiner trees
0 references
square lattice
0 references
0.9038091897964478
0 references
0.903809130191803
0 references
0.8874587416648865
0 references
0.8874587416648865
0 references
0.8598565459251404
0 references
