@InProceedings{dereniowski_et_al:LIPIcs.MFCS.2022.42,
author = {Dereniowski, Dariusz and Wrosz, Izajasz},
title = {{Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times}},
booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)},
pages = {42:1--42:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-256-3},
ISSN = {1868-8969},
year = {2022},
volume = {241},
editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.42},
URN = {urn:nbn:de:0030-drops-168405},
doi = {10.4230/LIPIcs.MFCS.2022.42},
annote = {Keywords: binary search, graph search, approximation algorithm, query complexity}
}