Pages that link to "Item:Q4037682"
From MaRDI portal
The following pages link to Tight Worst-Case Performance Bounds for Next-<i>k</i>-Fit Bin Packing (Q4037682):
Displayed 4 items.
- Best \(k\)-fit bin packing (Q685862) (← links)
- A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing (Q1299865) (← links)
- Worst-case analysis of fast heuristics for packing squares into a square (Q1365944) (← links)
- On-line bin packing ? A restricted survey (Q4845093) (← links)