An asymptotic competitive scheme for online bin packing.

Lin Chen Deshi Ye Guochuan Zhang

Published in: Theor. Comput. Sci. (2015)

Keyphrases

bin packing
polynomial time approximation
graph colouring
search tree
assembly line balancing
online learning
packing problem
approximation schemes
optimization problems
databases
lower bound
np hard
orders of magnitude
asymptotically optimal
cutting stock