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 profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230090103 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2075081396 / rank | |||
Normal rank | |||
Revision as of 14:22, 19 March 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
