Pages that link to "Item:Q476452"
From MaRDI portal
The following pages link to Improved approximation algorithms for the average-case tree searching problem (Q476452):
Displaying 14 items.
- On the tree search problem with non-uniform costs (Q306704) (← links)
- An approximation algorithm for binary searching in trees (Q633849) (← links)
- On the complexity of searching in trees and partially ordered structures (Q650925) (← links)
- Average-case analysis of best-first search in two representative directed acyclic graphs (Q814592) (← links)
- Approximate search strategies for weighted trees (Q1929222) (← links)
- Minimizing the average searching time for an object within a graph (Q2007833) (← links)
- On Dasgupta's hierarchical clustering objective and its relation to other graph parameters (Q2140508) (← links)
- The average complexity of depth-first search with backtracking and cutoff (Q3776618) (← links)
- Average-Case Lower Bounds for Searching (Q3813304) (← links)
- Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm (Q4229414) (← links)
- Improved search heuristics for the sa-tree (Q4458900) (← links)
- (Q4515740) (← links)
- Competitive Online Search Trees on Trees (Q6051990) (← links)
- Partial order multiway search (Q6535268) (← links)