Binary searching with nonuniform costs and its application to text retrieval

DOI10.1007/s004530010010zbMath0951.68028OpenAlexW2000843489MaRDI QIDQ1977134

Ricardo A. Baeza-Yates, Walter Cunto, Gonzalo Navarro, E. F. Barbosa, Nivio Ziviani

Publication date: 9 May 2000

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004530010010

zbMATH Keywords

heuristic algorithmbinary searching

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (4)

Operations research applications of dichotomous search ⋮ Optimal binary search trees with costs depending on the access paths. ⋮ An approximation algorithm for binary searching in trees ⋮ A strategy for searching with different access costs.

This page was built for publication: Binary searching with nonuniform costs and its application to text retrieval