Steiner Minimal Tree for Points on a Circle

DOI10.2307/2045853zbMATH Open0596.05022OpenAlexW4238006633MaRDI QIDQ3728014FDOQ3728014

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

Publication date: 1985

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

zbMATH Keywords

networkSteiner pointsSteiner treeminimal spanning treeSteiner ratioSteiner minimal tree

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (18)

• Minimal Networks: A Review
• Sparse hop spanners for unit disk graphs
• Steiner minimal trees for regular polygons
• Minimum Steiner trees on a set of concyclic points and their center
• Steiner minimal trees on regular polygons with centre
• Steiner minimal trees for bar waves
• IDENTIFYING STEINER MINIMAL TREES ON FOUR POINTS IN SPACE
• Title not available (Why is that?)
• Title not available (Why is that?)
• Geometry and topology of local minimal 2-trees
• Title not available (Why is that?)
• A primer of the Euclidean Steiner problem
• Steiner minimal trees for a class of zigzag lines
• Title not available (Why is that?)
• Steiner minimal trees for zigzag lines with ladders
• Cut and patch Steiner trees for ladders
• Graham's problem on shortest networks for points on a circle
• A PTAS for the Steiner Forest Problem in Doubling Metrics

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

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