Tighter bounds of the First Fit algorithm for the bin-packing problem.
Binzhou XiaZhiyi TanPublished in: Discret. Appl. Math. (2010)
Keyphrases
- lower bound
- preprocessing
- upper bound
- k means
- learning algorithm
- cost function
- worst case
- dynamic programming
- computational cost
- knapsack problem
- improved algorithm
- matching algorithm
- experimental evaluation
- bin packing
- computational complexity
- randomized algorithm
- monte carlo
- times faster
- upper and lower bounds
- average case
- high accuracy
- computationally efficient
- input data
- recognition algorithm
- probabilistic model
- np hard
- search space
- detection algorithm
- optimization algorithm
- theoretical analysis
- mobile robot