Tight bounds for NF-based bounded-space online bin packing algorithms
From MaRDI portal
Recommendations
- NF-based algorithms for online bin packing with buffer and bounded item size
- NF-based algorithms for online bin packing with buffer and item size limitation
- Online bin packing problem with buffer and bounded size revisited
- scientific article; zbMATH DE number 1092168
- A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing
Cites work
- An improved lower bound for on-line bin packing algorithms
- Batched bin packing
- Beating the harmonic lower bound for online bin packing
- scientific article; zbMATH DE number 910900 (Why is no real title available?)
- New lower bounds for certain classes of bin packing algorithms
- NF-based algorithms for online bin packing with buffer and bounded item size
- On the online bin packing problem
- On-line bin packing with restricted repacking
- Online bin packing problem with buffer and bounded size revisited
- Parametric Lower Bound for On-Line Bin-Packing
- Repacking helps in bounded space on-line bin-packing
- Resource augmented semi-online bounded space bin packing
Cited in
(3)
This page was built for publication: Tight bounds for NF-based bounded-space online bin packing algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702819)
