The largest minimal rectilinear steiner trees for a set of <i>n</i> points enclosed in a rectangle with given perimeter (Q4186240): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On Steiner trees for bounded point sets / rank | |||
Normal rank | |||
Latest revision as of 00:40, 13 June 2024
scientific article; zbMATH DE number 3623466
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
