The largest minimal rectilinear steiner trees for a set of <i>n</i> points enclosed in a rectangle with given perimeter (Q4186240)
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: The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter |
scientific article; zbMATH DE number 3623466
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The largest minimal rectilinear steiner trees for a set of <i>n</i> points enclosed in a rectangle with given perimeter |
scientific article; zbMATH DE number 3623466 |
Statements
The largest minimal rectilinear steiner trees for a set of <i>n</i> points enclosed in a rectangle with given perimeter (English)
0 references
1979
0 references
Largest Minimal Rectilinear Steiner Trees
0 references
Network Programming
0 references
Semiperimeter
0 references
