A 71/60 theorem for bin packing (Q1083194): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0885-064x(85)90022-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2004690405 / rank | |||
Normal rank | |||
Latest revision as of 10:55, 30 July 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
0 references
