A 71/60 theorem for bin packing (Q1083194): Difference between revisions

The First Fit Decreasing algorithm for bin packing has long been famous for its guarantee that no packing it generates will use more than \(11/9=1.222..\). times the optimal number of bins. We present a simple modified version that has essentially the same running time, should perform at least as well on average, and yet provides a guarantee of \(71/60=1.18333... \).