Tight bounds for online class-constrained packing
From MaRDI portal
(Redirected from Tight bounds for online class-constrained packing)
Recommendations
- Tight bounds for online class-constrained packing
- The Class Constrained Bin Packing Problem with Applications to Video-on-Demand
- The class constrained bin packing problem with applications to video-on-demand
- Polynomial time approximation schemes for class-constrained packing problems
- Online bin packing with cardinality constraints resolved
Cited in
(5)- Probabilistic analysis of online (class-constrained) bin packing and bin covering
- The class constrained bin packing problem with applications to video-on-demand
- Polynomial time approximation schemes for class-constrained packing problems
- The Class Constrained Bin Packing Problem with Applications to Video-on-Demand
- Tight bounds for online class-constrained packing
This page was built for publication: Tight bounds for online class-constrained packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3044356)