Graham's problem on shortest networks for points on a circle

DOI10.1007/BF01758758zbMath0748.05051OpenAlexW2058886340WikidataQ61714643 ScholiaQ61714643MaRDI QIDQ1186796

Joachim Hyam Rubinstein, Doreen Anne Thomas

Publication date: 28 June 1992

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01758758

zbMATH Keywords

treeSteiner problemSteiner treeGraham's conjecture

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12)

Related Items (9)

On the Steiner ratio in 3-space ⋮ Interior normal lengths on convex configurations ⋮ Minimum Steiner trees on a set of concyclic points and their center ⋮ Steiner minimal trees in small neighbourhoods of points in Riemannian manifolds ⋮ Minimal Networks: A Review ⋮ A primer of the Euclidean Steiner problem ⋮ Directional derivative of the weight of a minimal filling in Riemannian manifolds ⋮ The Steiner minimal network for convex configurations ⋮ Perimeter-minimizing triple bubbles in the plane and the 2-sphere

Cites Work

• A variational approach to the Steiner network problem
• The Steiner ratio conjecture for six points
• The Steiner ratio conjecture for cocircular points
• Some remarks on the Steiner problem
• On the Problem of Steiner
• Steiner Minimal Tree for Points on a Circle
• Degree-five Steiner points cannot reduce network costs for planar sets
• The Complexity of Computing Steiner Minimal Trees
• Steiner Minimal Trees

This page was built for publication: Graham's problem on shortest networks for points on a circle