On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing

János Csirik David S. Johnson Claire Kenyon

Published in: CoRR (2005)

Keyphrases

bin packing
worst case
k means
average case
np hard
learning algorithm
dynamic programming
assembly line balancing
space complexity
search space
optimal solution
upper bound
cost function
greedy algorithm
simulated annealing
error bounds
computational complexity
database