Packing small vectors
From MaRDI portal
Recommendations
Cited in
(16)- Open-end bin packing: new and old analysis approaches
- Online bin packing with cardinality constraints resolved
- Lower bounds for online bin covering-type problems
- Approximation and online algorithms for multidimensional bin packing: a survey
- Online two-dimensional vector packing with advice
- scientific article; zbMATH DE number 566079 (Why is no real title available?)
- scientific article; zbMATH DE number 2016848 (Why is no real title available?)
- scientific article; zbMATH DE number 6813620 (Why is no real title available?)
- Randomized algorithms for online vector load balancing
- Online bin packing with cardinality constraints resolved
- Online Submodular Maximization Problem with Vector Packing Constraint.
- Tight bounds for online vector bin packing
- Several methods of analysis for cardinality constrained bin packing
- Several methods of analysis for cardinality constrained bin packing
- On data reduction for dynamic vector bin packing
- Online two-dimensional load balancing
This page was built for publication: Packing small vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575687)