A subquadratic algorithm for constructing approximately optimal binary search trees
From MaRDI portal
Publication:3795240
DOI10.1016/0196-6774(87)90052-6zbMath0649.68061OpenAlexW2067704863MaRDI QIDQ3795240
Publication date: 1987
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://escholarship.org/uc/item/4v7249bv
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (6)
A new genetic approach to construct near-optimal binary search trees ⋮ Operations research applications of dichotomous search ⋮ Optimal binary search trees with costs depending on the access paths. ⋮ Optimal binary search trees ⋮ Restructuring binary search trees revisited ⋮ A strategy for searching with different access costs.
This page was built for publication: A subquadratic algorithm for constructing approximately optimal binary search trees
