Approximation strategies for generalized binary search in weighted trees
From MaRDI portal
Recommendations
- Improved approximation algorithms for the average-case tree searching problem
- Approximate search strategies for weighted trees
- On the complexity of searching in trees: average-case minimization
- Binary identification problems for weighted trees
- On the complexity of searching in trees and partially ordered structures
Cited in
(19)- Binary search in graphs revisited
- The binary identification problem for weighted trees
- Approximate search strategies for weighted trees
- On Huang and Wong's algorithm for generalized binary split trees
- An efficient noisy binary search in graphs via Median approximation
- On the tree search problem with non-uniform costs
- On the tree search problem with non-uniform costs
- An Approximation Algorithm for Binary Searching in Trees
- On the complexity of searching in trees: average-case minimization
- Weighted Binary Trees for Concurrent Searching
- Binary identification problems for weighted trees
- Deterministic and probabilistic binary search in graphs
- The complexity of bicriteria tree-depth
- The complexity of bicriteria tree-depth
- Theoretical analysis of git bisect
- Weighted online search
- Edge and pair queries-random graphs and complexity
- An approximation algorithm for binary searching in trees
- Theoretical Analysis of Git Bisect
This page was built for publication: Approximation strategies for generalized binary search in weighted trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111415)
