Minimum networks for four points in space
type: Item
instance of: scholarly article
title: Minimum networks for four points in space
zbMATH Open document ID: 1009.05042
DOI: 10.1023/A:1020389712969
author: Yanyan Li
published in: Geometriae Dedicata
publication date: 2002-12-15T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 65K10
zbMATH DE Number: 1845447
zbMATH Keywords: minimum network
zbMATH Keywords: Steiner tree
reviewed by: Imre Bárány
MaRDI profile type: Publication
full work available at URL: a:1020389712969
OpenAlex ID: W179792009
Wikidata QID: Q61714638
Recommended article: Q3837117
Recommended article: Minimum networks in uniform orientation metrics
Recommended article: Q4945792
Recommended article: Minimal networks on the regular \(n\)-dimensional simplex
Recommended article: SOME PROBLEMS CONCERNING MINIMAL NETWORKS
Recommended article: Extremal problems in Minkowski space related to minimal networks
Recommended article: On the minimum feasible graph for four sets
Recommended article: IDENTIFYING STEINER MINIMAL TREES ON FOUR POINTS IN SPACE
Recommended article: An evolutionary design of weighted minimum networks for four points in the three-dimensional Euclidean space
Recommended article: Steiner minimal trees on sets of four points
description: scientific article; zbMATH DE number 1845447