Lower bounds for several online variants of bin packing

08/10/2017
by   János Balogh, et al.
0

We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them. For that, we use a method of fully adaptive constructions. In particular, we improve the lower bound for the asymptotic competitive ratio of online square packing significantly, raising it from roughly 1.68 to above 1.75.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/03/2020

Truly asymptotic lower bounds for online vector bin packing

In this work, we consider online vector bin packing. It is known that no...
research
05/18/2021

Online bin packing of squares and cubes

In the d-dimensional online bin packing problem, d-dimensional cubes of ...
research
01/22/2021

Online Packing to Minimize Area or Perimeter

We consider online packing problems where we get a stream of axis-parall...
research
01/16/2022

Lower bounds on the performance of online algorithms for relaxed packing problems

We prove new lower bounds for suitable competitive ratio measures of two...
research
11/27/2021

Scheduling Appointments Online: The Power of Deferred Decision-Making

The recently introduced online Minimum Peak Appointment Scheduling (MPAS...
research
12/23/2022

Circle packing in regular polygons

We study the packing of a large number of congruent and non–overlapping ...
research
12/07/2021

Online Sorting and Translational Packing of Convex Polygons

We investigate various online packing problems in which convex polygons ...

Please sign up or login with your details

Forgot password? Click here to reset