Minimum Steiner trees in normed planes
From MaRDI portal
Publication:1802220
DOI10.1007/BF02189328zbMATH Open0774.05028MaRDI QIDQ1802220FDOQ1802220
Authors: Du Ding-Zhu, Biao Gao, Ron Graham, Zicheng Liu, Peng-Jun Wan
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
Recommendations
- On Steiner minimal trees with \(L_ p\) distance
- A tight lower bound for the Steiner ratio in Minkowski planes
- On Steiner ratio conjectures
- scientific article
- scientific article; zbMATH DE number 1735733
- Publication:3484850
- scientific article; zbMATH DE number 1560328
- scientific article; zbMATH DE number 15865
- scientific article; zbMATH DE number 1263241
- scientific article; zbMATH DE number 7529
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)
Cites Work
- Steiner Minimal Trees
- Paired calibrations applied to soap films, immiscible fluids, and surfaces or networks minimizing other norms
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- A proof of the Gilbert-Pollak conjecture on the Steiner ratio
- The Complexity of Computing Steiner Minimal Trees
- The Fermat problem in Minkowski spaces
- On Steiner Minimal Trees with Rectilinear Distance
- Locating the vertices of a steiner tree in an arbitrary metric space
- Reducing the Steiner Problem in a Normed Space
- On the Steiner Problem
- The structure of singularities in \(\Phi\)-minimizing networks in \({\mathbb{R}}^ 2\)
- Title not available (Why is that?)
- On Steiner minimal trees with \(L_ p\) distance
Cited In (21)
- Steiner trees for fixed orientation metrics
- Title not available (Why is that?)
- The local Steiner problem in normed planes
- The Steiner ratio of high-dimensional Banach--Minkowski spaces.
- The length of an extremal network in a normed space: Maxwell formula
- Steiner minimal trees on regular polygons with centre
- Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm
- Optimal Steiner Points
- The local Steiner problem in finite-dimensional normed spaces
- Steiner minimal trees in rectilinear and octilinear planes
- Title not available (Why is that?)
- Packing, covering and tiling in two-dimensional spaces
- The Steiner Minimal Tree problem in the λ-geometry plane
- Title not available (Why is that?)
- Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane
- Generalised \(k\)-Steiner tree problems in normed planes
- The Fermat--Torricelli problem in normed planes and spaces
- Full minimal Steiner trees on lattice sets
- A tight lower bound for the Steiner ratio in Minkowski planes
- The Steiner ratio for the dual normed plane
- Exact computation of Steiner minimal trees in the plane
This page was built for publication: Minimum Steiner trees in normed planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802220)