scientific article; zbMATH DE number 4047146

MaRDI QIDQ3783595zbMATH OpenFDO

Authors Christos Levcopoulos, Andrzej Lingas

Publication date 1987

zbMATH Keywords

binary search treeslinear-time heuristicminimum length triangulations of semi-circular polygons

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Heuristics for optimum binary search trees and minimum weight triangulation problems
• On binary search trees
• The geometry of binary search trees
• Optimal binary search trees
• Optimal search trees using two-way key comparisons

Cited in

(5)

• Heuristics for optimum binary search trees and minimum weight triangulation problems
• On binary search trees
• A subquadratic algorithm for constructing approximately optimal binary search trees
• Improved search heuristics for the sa-tree
• The Geometry of Generalized Binary Search

This page was built for publication:

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