Recommendations
Cites work
- scientific article; zbMATH DE number 3912403 (Why is no real title available?)
- A New Bound for the Steiner Ratio
- A class of full Steiner minimal trees
- Fuzzy sets
- Hexagonal coordinate systems and Steiner minimal trees
- On the Problem of Steiner
- Steiner Minimal Tree for Points on a Circle
- Steiner Minimal Trees on Zig-Zag Lines
- Steiner Trees for Ladders
- Steiner minimal trees for bar waves
- The Complexity of Computing Steiner Minimal Trees
Cited in
(44)- Sparse hop spanners for unit disk graphs
- Steiner Minimal Tree for Points on a Circle
- scientific article; zbMATH DE number 440765 (Why is no real title available?)
- Steiner minimal trees on sets of four points
- Efficient algorithms for Euclidean Steiner minimal tree on near-convex terminal sets
- Steiner trees with infinitely many terminals on the sides of an angle
- Calibrations for minimal networks in a covering space setting
- On the Enumeration of Steiner-Tree Topologies for the Points on a Circle
- Minimum Steiner trees on a set of concyclic points and their center
- On the history of the Euclidean Steiner tree problem
- Steiner minimal trees on regular polygons with centre
- A PTAS for the Steiner forest problem in doubling metrics
- Steiner minimal trees for bar waves
- Steiner Minimal Trees on Chinese Checkerboards
- Steiner minimal trees in rectilinear and octilinear planes
- scientific article; zbMATH DE number 1302189 (Why is no real title available?)
- Immersed polygons and their diagonal triangulations
- Steiner minimal trees with one polygonal obstacle.
- scientific article; zbMATH DE number 7765415 (Why is no real title available?)
- Minimal networks on the regular \(n\)-dimensional simplex
- Hexagonal coordinate systems and Steiner minimal trees
- scientific article; zbMATH DE number 3922677 (Why is no real title available?)
- Symmetrization theorem of full Steiner trees
- Extremal networks in -geometry, where =3,4,6
- How to find Steiner minimal trees in Euclidean \(d\)-space
- Steiner polygons in the Steiner problem
- A primer of the Euclidean Steiner problem
- Geometry and topology of local minimal 2-trees
- Planar Manhattan local minimal and critical networks
- Efficiently solvable special cases of hard combinatorial optimization problems
- scientific article; zbMATH DE number 5834213 (Why is no real title available?)
- scientific article; zbMATH DE number 8006 (Why is no real title available?)
- Minimal networks: a review
- Determining shortest networks in the Euclidean plane
- Steiner minimal trees for zigzag lines with ladders
- Cut and patch Steiner trees for ladders
- Minimal Steiner trees for rectangular arrays of lattice points
- The Steiner minimal network for convex configurations
- Minimum perimeter developments of the Platonic solids
- Uniqueness of Steiner minimal trees on boundaries in general position
- A Ginzburg-Landau model with topologically induced free discontinuities
- Minimal Steiner trees for 2^ k 2^ k square lattices
- GENERALIZED MELZAK'S CONSTRUCTION IN THE STEINER TREE PROBLEM
- Steiner minimal trees in small neighbourhoods of points in Riemannian manifolds
This page was built for publication: Steiner minimal trees for regular polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1085166)
