On the Steiner Problem

DOI10.4153/CMB-1967-041-8MaRDI QIDQ5543269zbMATH OpenOpenAlexFDO

Authors E. J. Cockayne

Publication date 1967

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/cmb-1967-041-8

zbMATH Keywords

metric geometry, convex geometry, integral geometry

Cited in

(19)

• Minimal surfaces, crystals, shortest networks, and undergraduate research
• The Steiner ratio for the dual normed plane
• The Steiner tree problem in orientation metrics
• Minimum Steiner trees in normed planes
• Optimal Steiner hull algorithm
• A tight lower bound for the Steiner ratio in Minkowski planes
• Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
• On the history of the Euclidean Steiner tree problem
• On the Gibbs states of the noncritical Potts model on \(\mathbb Z ^2\)
• Sets of unit vectors with small subset sums
• Quantitative Illumination of Convex Bodies and Vertex Degrees of Geometric Steiner Minimal Trees
• Steiner's problem and fagnano's result on the sphere
• Computation of Minimal Length Full Steiner Trees on the Vertices of a Convex Polygon
• Geometry and topology of local minimal 2-trees
• The local Steiner problem in normed planes
• A historical perspective on location problems
• Steiner tree problems
• Efficient algorithms for Euclidean Steiner minimal tree on near-convex terminal sets
• An analytical solution of the weighted Fermat-Torricelli problem on a unit sphere

This page was built for publication: On the Steiner Problem

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