Steiner minimal trees for regular polygons
From MaRDI portal
Publication:1085166
DOI10.1007/BF02187871zbMath0607.05022OpenAlexW2090486508MaRDI QIDQ1085166
Publication date: 1987
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131010
Related Items (20)
Sparse hop spanners for unit disk graphs ⋮ Hexagonal coordinate systems and Steiner minimal trees ⋮ Steiner minimal trees on regular polygons with centre ⋮ Cut and patch Steiner trees for ladders ⋮ Efficiently solvable special cases of hard combinatorial optimization problems ⋮ Determining shortest networks in the Euclidean plane ⋮ Extremal networks in $ \lambda$-geometry, where $ \lambda=3,4,6$ ⋮ Minimum Steiner trees on a set of concyclic points and their center ⋮ Steiner minimal trees in small neighbourhoods of points in Riemannian manifolds ⋮ Calibrations for minimal networks in a covering space setting ⋮ Unnamed Item ⋮ Minimal Networks: A Review ⋮ Geometry and topology of local minimal 2-trees ⋮ A PTAS for the Steiner Forest Problem in Doubling Metrics ⋮ A primer of the Euclidean Steiner problem ⋮ How to find Steiner minimal trees in Euclidean \(d\)-space ⋮ On the history of the Euclidean Steiner tree problem ⋮ Steiner minimal trees for zigzag lines with ladders ⋮ A Ginzburg-Landau model with topologically induced free discontinuities ⋮ Planar Manhattan local minimal and critical networks
Cites Work
- Steiner minimal trees for bar waves
- Hexagonal coordinate systems and Steiner minimal trees
- A class of full Steiner minimal trees
- On the Problem of Steiner
- A New Bound for the Steiner Ratio
- Steiner Minimal Trees on Zig-Zag Lines
- Steiner Minimal Tree for Points on a Circle
- Steiner Trees for Ladders
- The Complexity of Computing Steiner Minimal Trees
- Fuzzy sets
- Unnamed Item
This page was built for publication: Steiner minimal trees for regular polygons
