Two for One: Tight Approximation of 2D Bin Packing.

Rolf Harren Klaus Jansen Lars Prädel Ulrich M. Schwarz Rob van Stee

Published in: Int. J. Found. Comput. Sci. (2013)

Keyphrases

bin packing
approximation schemes
assembly line balancing
graph colouring
lower bound
polynomial time approximation
search tree
cutting stock
upper bound
packing problem
approximation algorithms
databases
database
shape analysis
constraint satisfaction
special case
reinforcement learning