Tight Worst-Case Performance Bounds for Next-<i>k</i>-Fit Bin Packing (Q4037682)
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: Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing |
scientific article; zbMATH DE number 168998
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight Worst-Case Performance Bounds for Next-<i>k</i>-Fit Bin Packing |
scientific article; zbMATH DE number 168998 |
Statements
Tight Worst-Case Performance Bounds for Next-<i>k</i>-Fit Bin Packing (English)
0 references
16 May 1993
0 references
worst-case performance
0 references
bin packing
0 references
approximate algorithm
0 references
0.8913277983665466
0 references
0.8877626061439514
0 references
