An improved approximation scheme for variable-sized bin packing

Abstract

The variable-sized bin packing problem (VBP) is a well-known generalization of the NP-hard bin packing problem (BP) where the items can be packed in bins of M given sizes. The objective is to minimize the total capacity of the bins used. We present an AFPTAS for VBP and BP with performance guarantee . The additive term is much smaller than the additive term of already known AFPTAS. The running time of the algorithm is for bin packing and for variable-sized bin packing, which is an improvement to previously known algorithms. © 2012 Springer-Verlag.