On the absolute approximation ratio for first fit and related results
From MaRDI portal
Publication:442205
DOI10.1016/j.dam.2012.04.012zbMath1247.90220OpenAlexW1998334645MaRDI QIDQ442205
Leah Epstein, György Dósa, Joan. Boyar
Publication date: 10 August 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.04.012
Related Items (7)
Bounds for online bin packing with cardinality constraints ⋮ Black and White Bin Packing Revisited ⋮ Best fit bin packing with random order revisited ⋮ More on batched bin packing ⋮ Batch scheduling of nonidentical job sizes with minsum criteria ⋮ Best Fit Bin Packing with Random Order Revisited ⋮ Online results for black and white bin packing
Cites Work
- Unnamed Item
- Unnamed Item
- A comparison of performance measures for online algorithms
- Tighter bounds of the First Fit algorithm for the bin-packing problem
- Tight results for next fit and worst fit with resource augmentation
- Resource constrained scheduling as generalized bin packing
- Fast algorithms for bin packing
- The relative worst order ratio for online algorithms
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Paging and list update under bijective analysis
This page was built for publication: On the absolute approximation ratio for first fit and related results
