The Steiner minimal network for convex configurations

DOI10.1007/BF02189325zbMath0774.05033OpenAlexW1995538437WikidataQ61714642 ScholiaQ61714642MaRDI QIDQ1207800

T. Cole, Doreen Anne Thomas, Joachim Hyam Rubinstein

Publication date: 16 May 1993

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131250

zbMATH Keywords

Steiner problemEuclidean planeSteiner treeminimal spanning treeshortest networkconvex configuration

Mathematics Subject Classification ID

Trees (05C05) Other problems of combinatorial convexity (52A37)

Related Items (1)

Interior normal lengths on convex configurations

Cites Work

• A variational approach to the Steiner network problem
• The Steiner ratio conjecture for six points
• The Steiner ratio conjecture for cocircular points
• Graham's problem on shortest networks for points on a circle
• On the Problem of Steiner
• The Complexity of Computing Steiner Minimal Trees

This page was built for publication: The Steiner minimal network for convex configurations