Title of article :
A linear approximation algorithm for bin packing with absolute approximation factor 32
Author/Authors :
Rudolf Berghammer، نويسنده , , Florian Reuter، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2003
Abstract :
We present a new approximation algorithm for the bin packing problem which has a linear running time and an absolute approximation factor of 32. It is known that this approximation factor is the best factor achievable, unless P=NP.
Keywords :
Bin packing , Approximation algorithm , Formal program development
Journal title :
Science of Computer Programming
Journal title :
Science of Computer Programming
