A 71/60 theorem for bin packing (Q1083194): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56212221, #quickstatements; #temporary_batch_1706339005099 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:46, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 71/60 theorem for bin packing |
scientific article |
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
