A well studied special case of bin packing is the 3-partition problem, where
n items of size >1/4 have to be packed in a minimum number of bins of capacity
one. The famous Karmarkar-Karp algorithm transforms a fractional solution of a
suitable LP relaxation for this problem into an integral solution that requires
at most O(log n) additional bins.