Solution of the Steiner problem for convex boundaries

DOI10.1070/RM1990V045N02ABEH002345MaRDI QIDQ3203048zbMATH OpenOpenAlexFDO

Authors A. A. Tuzhilin, A. O. Ivanov

Publication date 1990

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

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

zbMATH Keywords

Minimal Steiner graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Recommendations

• scientific article; zbMATH DE number 440764
• scientific article; zbMATH DE number 49566
• Exact computation of Steiner minimal trees in the plane
• Convexity and the Steiner tree problem
• The Steiner minimal network for convex configurations

Cited in

(9)

• The Steiner minimal network for convex configurations
• Conversion of the Steiner problem on the Euclidean plane to the Steiner problem on graph
• Immersed polygons and their diagonal triangulations
• scientific article; zbMATH DE number 440764 (Why is no real title available?)
• scientific article; zbMATH DE number 440765 (Why is no real title available?)
• scientific article; zbMATH DE number 3916324 (Why is no real title available?)
• The Steiner problem for infinitely many points
• Geometry and topology of local minimal 2-trees
• Minimal binary trees with a regular boundary: The case of skeletons with five endpoints

This page was built for publication: Solution of the Steiner problem for convex boundaries

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