On data reduction for dynamic vector bin packing
From MaRDI portal
Abstract: We study a dynamic vector bin packing (DVBP) problem. We show hardness for shrinking arbitrary DVBP instances to size polynomial in the number of request types or in the maximal number of requests overlapping in time. We also present a simple polynomial-time data reduction algorithm that allows to recover -approximate solutions for arbitrary . It shrinks instances from Microsoft Azure and Huawei Cloud by an order of magnitude for .
Recommendations
Cites work
- A branch-and-price algorithm for the temporal bin packing problem
- Approximation and online algorithms for multidimensional bin packing: a survey
- Dynamic Bin Packing
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Improved Approximation for Vector Bin Packing
- Integer Programming with a Fixed Number of Variables
- Kernelization Lower Bounds by Cross-Composition
- Kernelization. Theory of parameterized preprocessing
- Lossy kernelization
- Minkowski's Convex Body Theorem and Integer Programming
- Parametrized complexity theory.
- Presolve Reductions in Mixed Integer Programming
- There is no asymptotic PTAS for two-dimensional vector packing
This page was built for publication: On data reduction for dynamic vector bin packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6047700)