Cut and patch Steiner trees for ladders (Q1356409)
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 1018472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cut and patch Steiner trees for ladders |
scientific article; zbMATH DE number 1018472 |
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
0.7535096406936646
0 references
