Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms.
David S. JohnsonAlan J. DemersJeffrey D. UllmanM. R. GareyRonald L. GrahamPublished in: SIAM J. Comput. (1974)
Keyphrases
- worst case
- average case
- error bounds
- worst case analysis
- lower bound
- worst case bounds
- np hard
- greedy algorithm
- space complexity
- black box
- computationally efficient
- decision trees
- running times
- upper and lower bounds
- times faster
- machine learning
- orders of magnitude
- theoretical analysis
- data structure
- multi dimensional
- support vector
- computational complexity
- computational cost
- confidence bounds
- randomized algorithm
- online algorithms
- theoretical guarantees
- data mining algorithms
- lower and upper bounds
- approximation algorithms
- simulated annealing
- optimization problems
- computational efficiency