On Binary Searching with Nonuniform Costs

DOI10.1137/S0097539700381991zbMath1015.68234OpenAlexW2018691279MaRDI QIDQ2784491

Artur Alves Pessoa, Ruy Luiz Milidiú, Eduardo Sany Laber

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

scalingapproximation algorithmssearch trees

Mathematics Subject Classification ID

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

Related Items (4)

Operations research applications of dichotomous search ⋮ Edge and pair queries-random graphs and complexity ⋮ The complexity of bicriteria tree-depth ⋮ The complexity of bicriteria tree-depth

This page was built for publication: On Binary Searching with Nonuniform Costs