Steiner Minimal Trees on Zig-Zag Lines

DOI10.2307/1999307zbMATH Open0523.51018OpenAlexW4252925418MaRDI QIDQ3673573FDOQ3673573

Authors:

Publication date: 1983

Full work available at URL: https://doi.org/10.2307/1999307

zbMATH Keywords

NP-completeconvexnormalregularSteiner minimal treezig-zag line

Mathematics Subject Classification ID

Trees (05C05) Geometric constructions in real or complex geometry (51M15)

Cites Work

• Steiner Minimal Trees
• On the Problem of Steiner
• The Complexity of Computing Steiner Minimal Trees
• Some remarks on the Steiner problem
• Steiner Trees for Ladders
• An Improved Program for the Full Steiner Tree Problem

Cited In (17)

• Minimal Networks: A Review
• Steiner minimal trees on sets of four points
• On the Steiner ratio in 3-space
• Steiner minimal trees for regular polygons
• Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in \(E^ 3\)
• On the restricted 1-Steiner tree problem
• On the restricted \(k\)-Steiner tree problem
• Minimal length tree networks on the unit sphere
• Steiner minimal trees for bar waves
• Geometry and topology of local minimal 2-trees
• Analytic formulas for full Steiner trees
• A primer of the Euclidean Steiner problem
• Steiner minimal trees for a class of zigzag lines
• Determining shortest networks in the Euclidean plane
• Steiner minimal trees for zigzag lines with ladders
• Cut and patch Steiner trees for ladders
• Steiner minimal trees in small neighbourhoods of points in Riemannian manifolds

This page was built for publication: Steiner Minimal Trees on Zig-Zag Lines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3673573)