The Steiner ratio conjecture for six points

DOI10.1016/0097-3165(91)90073-PzbMath0739.05034OpenAlexW2027573422WikidataQ61714646 ScholiaQ61714646MaRDI QIDQ1177947

Joachim Hyam Rubinstein, Doreen Anne Thomas

Publication date: 26 June 1992

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(91)90073-p

zbMATH Keywords

decompositionvariational techniqueSteiner ratio conjecture

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory to circuits and networks (94C15)

Related Items (15)

A continuous version of a result of Du and Hwang ⋮ On greedy heuristic for Steiner minimum trees ⋮ On component-size bounded Steiner trees ⋮ Solving the prize‐collecting Euclidean Steiner tree problem ⋮ Geometry and topology of local minimal 2-trees ⋮ The Steiner ratio for five points ⋮ Directional derivative of the weight of a minimal filling in Riemannian manifolds ⋮ The Steiner ratio conjecture for cocircular points ⋮ A proof of the Gilbert-Pollak conjecture on the Steiner ratio ⋮ On Steiner minimal trees with \(L_ p\) distance ⋮ Graham's problem on shortest networks for points on a circle ⋮ ON CHARACTERISTIC AREA OF STEINER TREE ⋮ On better heuristics for Steiner minimum trees ⋮ The Steiner minimal network for convex configurations ⋮ A variational approach to the Steiner network problem

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• A variational approach to the Steiner network problem
• The Steiner ratio conjecture is true for five points
• Some remarks on the Steiner problem
• A short proof of a result of Pollak on Steiner minimal trees
• On the Problem of Steiner
• The Complexity of Computing Steiner Minimal Trees
• Steiner Minimal Trees

This page was built for publication: The Steiner ratio conjecture for six points