Cut and patch Steiner trees for ladders (Q1356409): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:03, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cut and patch Steiner trees for ladders |
scientific article |
Statements
Cut and patch Steiner trees for ladders (English)
0 references
9 June 1997
0 references
The authors show how to construct the Steiner minimum tree for a ladder by the cut and patch method. They prove that all intersection points between the Steiner tree and the ladder lie on two straight lines.
0 references
ladder
0 references
Steiner tree
0 references
