Steiner minimal trees on regular polygons with centre

DOI10.1016/0012-365X(93)E0183-5zbMath0826.05024MaRDI QIDQ1894775

R. S. Booth, Jia Feng Weng

Publication date: 24 July 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

centerEuclidean planeSteiner minimum treeregular polygonpoint set

Mathematics Subject Classification ID

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

Related Items (1)

Minimum Steiner trees on a set of concyclic points and their center

Cites Work

• Unnamed Item
• Steiner minimal trees for regular polygons
• A proof of the Gilbert-Pollak conjecture on the Steiner ratio
• Steiner minimal trees for a class of zigzag lines
• Cost allocation for steiner trees
• Determining shortest networks in the Euclidean plane
• Steiner Minimal Trees
• On the Efficiency of the Algorithm for Steiner Minimal Trees
• Steiner tree problems

This page was built for publication: Steiner minimal trees on regular polygons with centre