A short proof of a result of Pollak on Steiner minimal trees
From MaRDI portal
Publication:1837195
DOI10.1016/0097-3165(82)90056-5zbMath0507.05028OpenAlexW1977726270MaRDI QIDQ1837195
Publication date: 1982
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(82)90056-5
Trees (05C05) Inequalities and extremum problems involving convexity in convex geometry (52A40) Other problems of combinatorial convexity (52A37)
Related Items
Analytic formulas for full Steiner trees ⋮ The Steiner ratio conjecture for six points ⋮ A primer of the Euclidean Steiner problem ⋮ The Steiner ratio for five points ⋮ On Steiner ratio conjectures ⋮ The Steiner ratio conjecture for cocircular points ⋮ ON CHARACTERISTIC AREA OF STEINER TREE ⋮ A faster approximation algorithm for the Steiner problem in graphs ⋮ The Steiner ratio conjecture is true for five points ⋮ A variational approach to the Steiner network problem
Cites Work
