A 71/60 theorem for bin packing (Q1083194)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A 71/60 theorem for bin packing |
scientific article; zbMATH DE number 3976332
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 71/60 theorem for bin packing |
scientific article; zbMATH DE number 3976332 |
Statements
A 71/60 theorem for bin packing (English)
0 references
1985
0 references
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... \).
0 references
modification of the First Fit Decreasing algorithm
0 references
0 references
