Bin packing can be solved within 1+epsilon in linear time.

Wenceslas Fernandez de la Vega George S. Lueker

Published in: Comb. (1981)

Keyphrases

bin packing
graph colouring
assembly line balancing
packing problem
search tree
cutting stock
high dimensional
np hard
complexity analysis