On data reduction for dynamic vector bin packing

05/18/2022
by   René van Bevern, et al.
0

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

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/23/2019

Approximation schemes for the generalized extensible bin packing problem

We present a new generalization of the extensible bin packing with unequ...
research
11/22/2020

Tiling with Squares and Packing Dominos in Polynomial Time

We consider planar tiling and packing problems with polyomino pieces and...
research
01/08/2021

Almost Optimal Inapproximability of Multidimensional Packing Problems

Multidimensional packing problems generalize the classical packing probl...
research
08/29/2023

Finding Optimal 2-Packing Sets on Arbitrary Graphs at Scale

A 2-packing set for an undirected graph G=(V,E) is a subset 𝒮⊂ V such th...
research
07/30/2020

An Asymptotic Lower Bound for Online Vector Bin Packing

We consider the online vector bin packing problem where n items specifie...
research
05/28/2020

Two-Bar Charts Packing Problem

We consider a Bar Charts Packing Problem (BCPP), in which it is necessar...
research
05/27/2011

Order of Magnitude Comparisons of Distance

Order of magnitude reasoning - reasoning by rough comparisons of the siz...

Please sign up or login with your details

Forgot password? Click here to reset