Steiner Minimal Tree for Points on a Circle

DOI10.2307/2045853zbMath0596.05022OpenAlexW4238006633MaRDI QIDQ3728014

Ding-Zhu Du, S. C. Chao, Frank K. Hwang

Publication date: 1985

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

zbMATH Keywords

networkSteiner pointsSteiner minimal treeSteiner treeminimal spanning treeSteiner ratio

Mathematics Subject Classification ID

Trees (05C05) Euclidean geometries (general) and generalizations (51M05)

Related Items (12)

Sparse hop spanners for unit disk graphs ⋮ Steiner minimal trees for regular polygons ⋮ Cut and patch Steiner trees for ladders ⋮ 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 ⋮ Graham's problem on shortest networks for points on a circle ⋮ Steiner minimal trees for a class of zigzag lines ⋮ Steiner minimal trees for zigzag lines with ladders ⋮ Steiner minimal trees for bar waves

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• A New Bound for the Steiner Ratio
• A note on bisecting minimum spanning trees
• The Complexity of Computing Steiner Minimal Trees
• Steiner Minimal Trees

This page was built for publication: Steiner Minimal Tree for Points on a Circle