Some upper bounds for minimal trees

DOI10.1016/0020-0190(91)90102-NMaRDI QIDQ1178229zbMATH OpenOpenAlexFDO

Authors J. M. Basart

Publication date 26 June 1992

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(91)90102-n

zbMATH Keywords

Euclidean Steiner minimal treeminimal treesrectilinear minimal treerectilinear Steiner minimal treeupper bounds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 3912403
• Upper and lower bounds for the lengths of Steiner trees in 3-space
• Shortest trees and Steiner trees with rectilinear distances
• Approximations and lower bounds for the length of minimal Euclidean Steiner trees
• Steiner minimal trees for regular polygons

Cites work

• On Steiner trees for bounded point sets
• On Steiner’s Problem with Rectilinear Distance
• Steiner Minimal Trees
• The Complexity of Computing Steiner Minimal Trees
• The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter
• The shortest path and the shortest road through n points

Cited in

(12)

• A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes
• Minimal nonstandard Coxeter trees
• Rectilinear spanning trees versus bounding boxes
• On the minimum value of the Colless index and the bifurcating trees that achieve it
• Upper and lower bounds for the lengths of Steiner trees in 3-space
• Trees with minimum F-coindex
• Approximations and lower bounds for the length of minimal Euclidean Steiner trees
• The evolution of the structure of ABC-minimal trees
• Sharp upper bound involving circuit layout system
• scientific article; zbMATH DE number 3853142 (Why is no real title available?)
• scientific article; zbMATH DE number 3912403 (Why is no real title available?)
• Minimal binary trees with regular boundary: the case of sceletons with four ends

This page was built for publication: Some upper bounds for minimal trees

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