A new lower bound for classic online bin packing

07/15/2018
by   János Balogh, et al.
0

We improve the lower bound on the asymptotic competitive ratio of any online algorithm for bin packing to above 1.54278. We demonstrate for the first time the advantage of branching and the applicability of full adaptivity in the design of lower bounds for the classic online bin packing problem. We apply a new method for weight based analysis, which is usually applied only in proofs of upper bounds. The values of previous lower bounds were approximately 1.5401 and 1.5403.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/23/2018

A lower bound for online rectangle packing

We slightly improve the known lower bound on the asymptotic competitive ...
research
01/13/2020

Lower Bounds for Shoreline Searching with 2 or More Robots

Searching for a line on the plane with n unit speed robots is a classic ...
research
07/29/2021

Density of Binary Disc Packings:Lower and Upper Bounds

We provide, for any r∈ (0,1), lower and upper bounds on the maximal dens...
research
06/20/2023

Online Vector Bin Packing and Hypergraph Coloring Illuminated: Simpler Proofs and New Connections

This paper studies the online vector bin packing (OVBP) problem and the ...
research
02/10/2023

Online Algorithms with Randomly Infused Advice

We introduce a novel method for the rigorous quantitative evaluation of ...
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
12/19/2017

A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game

We prove a tight lower bound on the asymptotic performance ratio ρ of th...

Please sign up or login with your details

Forgot password? Click here to reset