Randomized computations on large data sets: tight lower bounds.
Martin GroheAndré HernichNicole SchweikardtPublished in: PODS (2006)
Keyphrases
- lower bound
- randomized algorithms
- upper bound
- randomized algorithm
- branch and bound algorithm
- data sets
- branch and bound
- np hard
- objective function
- worst case
- lower bounding
- optimal solution
- lower and upper bounds
- privacy preserving association rule mining
- decision forest
- quadratic assignment problem
- optimal cost
- randomly generated problems
- small data sets
- linear programming relaxation
- max sat
- upper and lower bounds
- special case
- data analysis
- e learning