A strategy for searching with different access costs.
From MaRDI portal
Publication:1853499
DOI10.1016/S0304-3975(01)00262-6zbMath1061.68040OpenAlexW2032297021MaRDI QIDQ1853499
Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
Publication date: 21 January 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00262-6
Related Items (2)
Operations research applications of dichotomous search ⋮ An approximation algorithm for binary searching in trees
Cites Work
- Nearly optimal binary search trees
- Binary searching with nonuniform costs and its application to text retrieval
- On binary search trees
- Optimum binary search trees
- On an efficient dynamic programming technique of F. F. Yao
- A subquadratic algorithm for constructing approximately optimal binary search trees
- Search in an Ordered Array Having Variable Probe Cost
- Minimum average cost testing for partially ordered components
This page was built for publication: A strategy for searching with different access costs.
