A Tight Approximation for Fully Dynamic Bin Packing without Bundling

11/03/2017
by   Björn Feldkord, et al.
0

We consider a variant of the classical Bin Packing Problem, called Fully Dynamic Bin Packing. In this variant, items of a size in (0,1] must be packed in bins of unit size. In each time step, an item either arrives or departs from the packing. An algorithm for this problem must maintain a feasible packing while only repacking a bounded number of items in each time step. We develop an algorithm which repacks only a constant number of items per time step and, unlike previous work, does not rely on bundling of small items which allowed those solutions to move an unbounded number of small items as one. Our algorithm has an asymptotic approximation ratio of roughly 1.3871 which is complemented by a lower bound of Balogh et al., resulting in a tight approximation ratio for this problem. As a direct corollary, we also close the gap to the lower bound of the Relaxed Online Bin Packing Problem in which only insertions of items occur.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/06/2017

Fully-Dynamic Bin Packing with Limited Repacking

We consider the bin packing problem in a fully-dynamic setting, where ne...
research
10/26/2018

Packing Returning Secretaries

We study online secretary problems with returns in combinatorial packing...
research
11/09/2020

An APTAS for Bin Packing with Clique-graph Conflicts

We study the following variant of the classic bin packing problem. The i...
research
03/18/2022

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

We solve the Bin Packing problem in O^*(2^k) time, where k is the number...
research
01/31/2020

Stochastic Extensible Bin Packing

We consider the stochastic extensible bin packing problem (SEBP) in whic...
research
08/25/2023

A Poisson-Based Approximation Algorithm for Stochastic Bin Packing of Bernoulli Items

A cloud scheduler packs tasks onto machines with contradictory goals of ...
research
08/19/2019

On bin packing with clustering and bin packing with delays

We continue the study of two recently introduced bin packing type proble...

Please sign up or login with your details

Forgot password? Click here to reset