Least Upper Bound on the Cost of Optimum Binary Search Trees.

T. C. Hu K. C. Tan

Published in: Acta Informatica (1972)

Keyphrases

upper bound
binary search trees
lower bound
data structure
optimal cost
search tree
branch and bound algorithm
parallel algorithm
worst case
kd trees
lower and upper bounds
cost sensitive
expected cost
global optimum
branch and bound
database
constant factor
information retrieval systems
error probability
databases