Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm.

Yaniv Sadeh Haim Kaplan

Published in: CoRR (2023)

Keyphrases

improved algorithm
dynamic programming
k means
objective function
lower bound
optimal solution
computational complexity
np hard
linear programming
search space
cost function
worst case
lower and upper bounds
binary search trees
particle swarm optimization
similarity measure
nearest neighbor
kd trees