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

Klaus Jansen Lars Prädel Ulrich M. Schwarz

Published in: WADS (2009)

Keyphrases

bin packing
approximation schemes
assembly line balancing
graph colouring
polynomial time approximation
search tree
cutting stock
lower bound
approximation algorithms
packing problem
data structure
np hard
worst case
branch and bound algorithm