Minimum networks for four points in space
From MaRDI portal
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.
Recommendations
- scientific article; zbMATH DE number 1382484
- Minimum networks in uniform orientation metrics
- Publication:4945792
- Minimal networks on the regular \(n\)-dimensional simplex
- SOME PROBLEMS CONCERNING MINIMAL NETWORKS
- Extremal problems in Minkowski space related to minimal networks
- On the minimum feasible graph for four sets
- IDENTIFYING STEINER MINIMAL TREES ON FOUR POINTS IN SPACE
- An evolutionary design of weighted minimum networks for four points in the three-dimensional Euclidean space
- Steiner minimal trees on sets of four points
Cited in
(15)- Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points
- Steiner minimal trees on sets of four points
- Variational approach and Steiner minimal trees on four points
- Gradient-constrained minimum networks. III: Fixed topology
- Computing Steiner points for gradient-constrained minimum networks
- An evolutionary design of weighted minimum networks for four points in the three-dimensional Euclidean space
- Upper and lower bounds for the lengths of Steiner trees in 3-space
- Approximate Euclidean Steiner trees
- Euclidean Steiner trees optimal with respect to swapping 4-point subtrees
- Bifurcations of Steiner minimal trees and minimal fillings for non-convex four-point boundaries and Steiner subratio for the Euclidean plane
- IDENTIFYING STEINER MINIMAL TREES ON FOUR POINTS IN SPACE
- scientific article; zbMATH DE number 1382484 (Why is no real title available?)
- Computing Steiner points and probability Steiner points in \(\ell _{1}\) and \(\ell _{2}\) metric spaces
- Equivalence, indicators, quasi-indicators and optimal Steiner topologies on four points in space
- A Lagrangian program detecting the weighted Fermat-Steiner-Fréchet multitree for a Fréchet N-multisimplex in Euclidean N-space
This page was built for publication: Minimum networks for four points in space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1851073)
