Login / Signup
Greedy Binary Search Trees are Nearly Optimal.
James F. Korsh
Published in:
Inf. Process. Lett. (1981)
Keyphrases
</>
binary search trees
data structure
search tree
parallel algorithm
search algorithm
dynamic programming
kd trees
feature selection
greedy heuristic
search space
particle swarm optimization
closed form
main memory
globally optimal
locally optimal