Go to the corresponding LIPIcs Volume Portal 
Dereniowski, Dariusz ; Wrosz, Izajasz
pdfformat: 

@InProceedings{dereniowski_et_al:LIPIcs.MFCS.2022.42, author = {Dereniowski, Dariusz and Wrosz, Izajasz}, title = {{ConstantFactor 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:142:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772563}, ISSN = {18688969}, year = {2022}, volume = {241}, editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16840}, URN = {urn:nbn:de:0030drops168405}, doi = {10.4230/LIPIcs.MFCS.2022.42}, annote = {Keywords: binary search, graph search, approximation algorithm, query complexity} }
Keywords:  binary search, graph search, approximation algorithm, query complexity  
Collection:  47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)  
Issue Date:  2022  
Date of publication:  22.08.2022 