On binary searching with nonuniform costs

DOI10.1137/S0097539700381991MaRDI QIDQ2784491zbMATH OpenOpenAlexFDO

Authors Artur Alves Pessoa, Eduardo S. Laber, Ruy L. Milidiú

Publication date 23 April 2002

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539700381991

zbMATH Keywords

approximation algorithmsscalingsearch trees

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

• On binary searching with non-uniform costs
• An approximation algorithm for binary searching in trees
• A strategy for searching with different access costs.
• Binary searching with nonuniform costs and its application to text retrieval
• An Approximation Algorithm for Binary Searching in Trees

Cited in

(11)

• Operations research applications of dichotomous search
• A strategy for searching with different access costs.
• Binary searching with nonuniform costs and its application to text retrieval
• On binary searching with non-uniform costs
• Search in an Ordered Array Having Variable Probe Cost
• Coping with errors in binary search procedures (Preliminary Report)
• The complexity of bicriteria tree-depth
• The complexity of bicriteria tree-depth
• Edge and pair queries-random graphs and complexity
• Noisy (binary) searching: simple, fast and correct
• A note on finding the minimum with non-uniform comparison costs

This page was built for publication: On binary searching with nonuniform costs

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