The Steiner Minimal Tree problem in the λ-geometry plane
From MaRDI portal
Publication:5871886
DOI10.1007/BFB0009501zbMATH Open1503.68281OpenAlexW2500007129MaRDI QIDQ5871886FDOQ5871886
Authors:
Publication date: 25 January 2023
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0009501
Recommendations
Cites Work
- Title not available (Why is that?)
- Minimum Steiner trees in normed planes
- A proof of the Gilbert-Pollak conjecture on the Steiner ratio
- The Complexity of Computing Steiner Minimal Trees
- Title not available (Why is that?)
- On Steiner Minimal Trees with Rectilinear Distance
- On Steiner’s Problem with Rectilinear Distance
- Reducing the Steiner Problem in a Normed Space
- On Steiner minimal trees with \(L_ p\) distance
Cited In (10)
- Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in \(E^ 3\)
- The 1-Steiner-Minimal-Tree problem in Minkowski-spaces
- On the Steiner property for planar minimizing clusters. The isotropic case
- The Steiner tree problem in \(\lambda_5\)-geometry. I
- Steiner minimal trees in rectilinear and octilinear planes
- Extremal networks in \(\lambda\)-geometry, where \(\lambda=3,4,6\)
- On Steiner minimal trees with \(L_ p\) distance
- Title not available (Why is that?)
- Forbidden subpaths for Steiner minimum networks in uniform orientation metrics
- The structure of minimal Steiner trees in the neighborhoods of the lunes of their edges
This page was built for publication: The Steiner Minimal Tree problem in the λ-geometry plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5871886)
