Weighted minimal binary trees

DOI10.1070/RM1995v050n03ABEH002569zbMath0847.05040OpenAlexW2048085690MaRDI QIDQ4884289

A. A. Tuzhilin, Alexandr O. Ivanov

Publication date: 29 September 1996

Published in: Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/rm1995v050n03abeh002569

zbMATH Keywords

Steiner problemweightweighted minimal networkstwist numberboundary setMelzak algorithmSimson lineminimal networksconvexity levelweighted binary trees

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

A plasticity principle of convex quadrilaterals on a convex surface of bounded specific curvature ⋮ Solving a generalized Gauss problem ⋮ Minimal binary trees with a regular boundary: The case of skeletons with five endpoints

This page was built for publication: Weighted minimal binary trees