A Tight Threshold Bound for Search Trees with 2-Way Comparisons.
Sunny AtaligMarek ChrobakPublished in: TAMC (2024)
Keyphrases
- search tree
- lower bound
- branch and bound algorithm
- upper bound
- worst case
- branch and bound
- search space
- search algorithm
- generalization error bounds
- sat solvers
- optimal solution
- binary search trees
- branching factor
- root node
- b tree
- data warehouse
- np hard
- data management
- dynamic programming
- symmetry breaking
- sat solving
- objective function