Minimum networks for four points in space (Q1851073): 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.1023/a:1020389712969 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W179792009 / rank | |||
Normal rank | |||
Latest revision as of 08:45, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum networks for four points in space |
scientific article |
Statements
Minimum networks for four points in space (English)
0 references
15 December 2002
0 references
The Steiner tree problem in space is much harder then in the plane. It is shown here, for instance, that Steiner trees on 4 points in space in general cannot be solved by radicals (see also \textit{St. Mehlhos} [Beitr. Algebra Geom. 41, 151-158 (2000; Zbl 0947.90094)]). The optimal Steiner tree ratio for 4 points in space is also determined.
0 references
minimum network
0 references
Steiner tree
0 references
