Determining shortest networks in the Euclidean plane (Q4299277)
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: Determining shortest networks in the Euclidean plane |
scientific article; zbMATH DE number 598320
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Determining shortest networks in the Euclidean plane |
scientific article; zbMATH DE number 598320 |
Statements
Determining shortest networks in the Euclidean plane (English)
0 references
15 September 1994
0 references
Steiner problem
0 references
Steiner minimal tree
0 references
NP-hard
0 references
embedding theorem
0 references
general Steiner polygons
0 references
symmetrisation theorem
0 references
zigzag lines
0 references
regular polygons
0 references
decomposition problem
0 references
orthogonal rectangles
0 references
