Minimum Steiner trees in normed planes
From MaRDI portal
Publication:1802220
DOI10.1007/BF02189328zbMath0774.05028MaRDI QIDQ1802220
Ronald L. Graham, Peng-Jun Wan, Biao Gao, Zi-Cheng Liu, Ding-Zhu Du
Publication date: 16 June 1993
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131252
Trees (05C05) Convex sets in (2) dimensions (including convex curves) (52A10) Convexity and finite-dimensional Banach spaces (including special norms, zonoids, etc.) (aspects of convex geometry) (52A21)
Related Items
The length of an extremal network in a normed space: Maxwell formula, A tight lower bound for the Steiner ratio in Minkowski planes, The Steiner ratio for the dual normed plane, Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm, Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane, The Steiner ratio of high-dimensional Banach--Minkowski spaces., Packing, covering and tiling in two-dimensional spaces, The local Steiner problem in normed planes, The Fermat--Torricelli problem in normed planes and spaces, Steiner trees for fixed orientation metrics, The Steiner Minimal Tree problem in the λ-geometry plane
Cites Work
- Unnamed Item
- The structure of singularities in \(\Phi\)-minimizing networks in \({\mathbb{R}}^ 2\)
- The Fermat problem in Minkowski spaces
- A proof of the Gilbert-Pollak conjecture on the Steiner ratio
- On Steiner minimal trees with \(L_ p\) distance
- Paired calibrations applied to soap films, immiscible fluids, and surfaces or networks minimizing other norms
- Reducing the Steiner Problem in a Normed Space
- Locating the vertices of a steiner tree in an arbitrary metric space
- On Steiner Minimal Trees with Rectilinear Distance
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- The Complexity of Computing Steiner Minimal Trees
- Steiner Minimal Trees
- On the Steiner Problem
