Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems
From MaRDI portal
Publication:5459151
Recommendations
Cited in
(8)- Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
- Tight approximations for resource constrained scheduling and bin packing
- Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems
- Fundamentals of Computation Theory
- Hardness of lazy packing and covering
- On lazy bin covering and packing problems
- On Lazy Bin Covering and Packing Problems
- On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
This page was built for publication: Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459151)