The local Steiner problem in normed planes
From MaRDI portal
Publication:4519132
DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0037(200009)36:2<104::AID-NET5>3.0.CO;2-K" /><104::AID-NET5>3.0.CO;2-K 10.1002/1097-0037(200009)36:2<104::AID-NET5>3.0.CO;2-KzbMath0971.90075OpenAlexW1975989652MaRDI QIDQ4519132
Publication date: 3 December 2000
Full work available at URL: https://doi.org/10.1002/1097-0037(200009)36:2<104::aid-net5>3.0.co;2-k
Related Items (10)
The length of an extremal network in a normed space: Maxwell formula ⋮ Rotationally optimal spanning and Steiner trees in uniform orientation metrics ⋮ Extremal networks in $ \lambda$-geometry, where $ \lambda=3,4,6$ ⋮ Minimal Networks: A Review ⋮ Shortest directed networks in the plane ⋮ Local structure of minimal networks in A. D. Alexandrov spaces ⋮ The Fermat--Torricelli problem in normed planes and spaces ⋮ Steiner trees for fixed orientation metrics ⋮ Absorbing angles, Steiner minimal trees, and antipodality ⋮ Quantitative Illumination of Convex Bodies and Vertex Degrees of Geometric Steiner Minimal Trees
Cites Work
- Unnamed Item
- Unnamed Item
- The structure of singularities in \(\Phi\)-minimizing networks in \({\mathbb{R}}^ 2\)
- Geometrical properties of the Fermat-Weber problem
- Minimum Steiner trees in normed planes
- Paired calibrations applied to soap films, immiscible fluids, and surfaces or networks minimizing other norms
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- On the Problem of Steiner
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- The Complexity of Computing Steiner Minimal Trees
- Euclidean Steiner minimum trees: An improved exact algorithm
- On Steiner’s Problem with Rectilinear Distance
- Steiner Minimal Trees
- On the Steiner Problem
This page was built for publication: The local Steiner problem in normed planes
