An Approximation Algorithm for Binary Searching in Trees

DOI10.1007/978-3-540-70575-8_38zbMath1153.68567OpenAlexW1590821367MaRDI QIDQ3521940

Marco Molinaro, Eduardo Sany Laber

Publication date: 28 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70575-8_38

Mathematics Subject Classification ID

Searching and sorting (68P10) Approximation algorithms (68W25)

Related Items (1)

On the complexity of searching in trees and partially ordered structures

This page was built for publication: An Approximation Algorithm for Binary Searching in Trees