Lower Bounding the AND-OR Tree via Symmetrization.
William KretschmerPublished in: ACM Trans. Comput. Theory (2021)
Keyphrases
- lower bounding
- lower bound
- branch and bound algorithm
- multi step
- dynamic time warping
- mathematical programming
- upper bounding
- distance computation
- lower and upper bounds
- similarity search
- tree structure
- edit distance
- euclidean distance
- upper bound
- nearest neighbor
- distance function
- genetic algorithm
- branch and bound
- b tree
- spanning tree
- optimal solution
- similarity measure
- tabu search
- index structure
- scheduling problem
- feature selection