  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 $(1 +
{\varepsilon})$-approximate solutions for arbitrary ${\varepsilon} > 0$. It
shrinks instances from Microsoft Azure and Huawei Cloud by an order of
magnitude for ${\varepsilon} = 0.02$.
