Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines
Johannes A. La PoutréPublished in: STOC (1990)
Keyphrases
- lower bound
- upper bound
- objective function
- branch and bound
- lower and upper bounds
- branch and bound algorithm
- data structure
- upper and lower bounds
- search algorithm
- special case
- np hard
- optimal solution
- lower bounding
- online algorithms
- max sat
- worst case
- quadratic assignment problem
- vc dimension
- parallel machines
- maximum likelihood
- database
- image segmentation
- neural network