Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm.
Yaniv SadehHaim KaplanPublished in: STACS (2023)
Keyphrases
- dynamic programming
- improved algorithm
- objective function
- np hard
- lower bound
- learning algorithm
- computational complexity
- k means
- binary search trees
- cost function
- optimal solution
- search space
- upper bound
- particle swarm optimization
- databases
- locally optimal
- database systems
- worst case
- orders of magnitude
- search strategy
- greedy heuristic