scientific article; zbMATH DE number 6767525
From MaRDI portal
Publication:5351895
Recommendations
- Fully dynamic bin packing revisited
- Fully-dynamic bin packing with little repacking
- Fully Dynamic Bin Packing
- Dynamic multi-dimensional bin packing
- Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
- A fundamental restriction on fully dynamic maintenance of bin packing
- Dynamic bin packing with unit fraction items revisited
- On dynamic bin packing: An improved lower bound and resource augmentation analysis
- On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
- Batched bin packing revisited
Cited in
(16)- Deep performance analysis of refined harmonic bin packing algorithm
- Dynamic bin packing with unit fraction items revisited
- Robust algorithms for total completion time
- Robust online algorithms for certain dynamic packing problems
- Fully dynamic bin packing revisited
- Online bin covering with limited migration
- Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time
- Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures
- On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
- Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
- Online strip packing with polynomial migration
- Fully-dynamic bin packing with little repacking
- Symmetry exploitation for online machine covering with bounded migration
- Fully Dynamic Bin Packing
- A robust AFPTAS for online bin packing with polynomial migration
- A fundamental restriction on fully dynamic maintenance of bin packing
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5351895)
