An Approximation Algorithm for Binary Searching in Trees

DOI10.1007/978-3-540-70575-8_38zbMATH Open1153.68567OpenAlexW1590821367MaRDI QIDQ3521940FDOQ3521940

Authors: Marco Molinaro, Eduardo S. 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

Recommendations

• An approximation algorithm for binary searching in trees
• Improved approximation algorithms for the average-case tree searching problem
• Approximation strategies for generalized binary search in weighted trees
• On the complexity of searching in trees: average-case minimization
• Fast searching in trees

Mathematics Subject Classification ID

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

Cited In (13)

• On binary searching with non-uniform costs
• A subquadratic algorithm for constructing approximately optimal binary search trees
• Binary search trees of almost optimal height
• Efficient search algorithm on compact S-trees
• The optimal binary search tree for Andersson's search algorithm
• Improved approximation algorithms for the average-case tree searching problem
• Title not available (Why is that?)
• An approximation algorithm for binary searching in trees
• On the complexity of searching in trees and partially ordered structures
• Practical approximation algorithms for zero- and bounded-skew trees
• On binary searching with nonuniform costs
• The Expected Performance of Traversal Algorithms in Binary Trees
• The cost of offline binary search tree algorithms and the complexity of the request sequence

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

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