Approximation schemes for ordered vector packing problems
From MaRDI portal
Publication:4456057
Recommendations
Cited in
(36)- Efficient algorithms for orthogonal packing problems
- Sequential vector packing
- Robust algorithms for preemptive scheduling
- Online interval coloring with packing constraints
- Vector bin packing with multiple-choice (extended abstract)
- Bin packing with controllable item sizes
- The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints
- There is no asymptotic PTAS for two-dimensional vector packing
- On Multidimensional Packing Problems
- Approximation Schemes for Packing Splittable Items with Cardinality Constraints
- Scheduling with cardinality dependent unavailability periods
- Approximation schemes for generalized two-dimensional vector packing with application to data placement
- Bin covering with cardinality constraints
- Bounds for online bin packing with cardinality constraints
- Bin packing with rejection revisited
- Class constrained bin packing revisited
- Online bin packing with cardinality constraints resolved
- Offline black and white bin packing
- Online bin packing with cardinality constraints resolved
- Improved lower bounds for the online bin packing problem with cardinality constraints
- Sequential Vector Packing
- EPTAS for the dual of splittable bin packing with cardinality constraint
- Class constrained bin covering
- scientific article; zbMATH DE number 6850331 (Why is no real title available?)
- Approximation schemes for packing splittable items with cardinality constraints
- Improved results for a memory allocation problem
- Set Covering with Ordered Replacement: Additive and Multiplicative Gaps
- scientific article; zbMATH DE number 1833403 (Why is no real title available?)
- Several methods of analysis for cardinality constrained bin packing
- Several methods of analysis for cardinality constrained bin packing
- Bin packing with general cost structures
- An AFPTAS for variable sized bin packing with general activation costs
- Selfish bin packing with cardinality constraints
- Vector bin packing with heterogeneous bins: application to the machine reassignment problem
- Algorithms for on-line bin-packing problems with cardinality constraints
- Improved Approximation for Vector Bin Packing
This page was built for publication: Approximation schemes for ordered vector packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4456057)
