Optimal binary search trees with costs depending on the access paths.
From MaRDI portal
Publication:1401195
DOI10.1016/S0304-3975(02)00084-1zbMath1044.68036OpenAlexW2088407423MaRDI QIDQ1401195
Jayme Luiz Szwarcfiter, Gonzalo Navarro, Walter Cunto, Joísa de S. Oliveira, Nivio Ziviani, Ricardo A. Baeza-Yates
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00084-1
Related Items (4)
A new genetic approach to construct near-optimal binary search trees ⋮ Operations research applications of dichotomous search ⋮ An approximation algorithm for binary searching in trees ⋮ Dynamic programming bi-criteria combinatorial optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Heuristics for optimum binary search trees and minimum weight triangulation problems
- Binary searching with nonuniform costs and its application to text retrieval
- Optimum binary search trees
- A subquadratic algorithm for constructing approximately optimal binary search trees
- Optimal Computer Search Trees and Variable-Length Alphabetical Codes
- Optimal binary search trees
This page was built for publication: Optimal binary search trees with costs depending on the access paths.
