DeepAI AI Chat
Log In Sign Up

Truly asymptotic lower bounds for online vector bin packing

by   János Balogh, et al.

In this work, we consider online vector bin packing. It is known that no algorithm can have a competitive ratio of o(d/log^2 d) in the absolute sense, though upper bounds for this problem were always shown in the asymptotic sense. Since variants of bin packing are traditionally studied with respect to the asymptotic measure and since the two measures are different, we focus on the asymptotic measure and prove new lower bounds on the asymptotic competitive ratio. The existing lower bounds prior to this work were much smaller than 3 even for very large dimensions. We significantly improve the best known lower bounds on the asymptotic competitive ratio (and as a byproduct, on the absolute competitive ratio) for online vector packing of vectors with d ≥ 3 dimensions, for every such dimension d. To obtain these results, we use several different constructions, one of which is an adaptive construction showing a lower bound of Ω(√(d)). Our main result is that the lower bound of Ω(d/log^2 d) on the competitive ratio holds also in the asymptotic sense. The last result requires a careful adaptation of constructions for online coloring rather than simple black-box reductions.


page 1

page 2

page 3

page 4


Lower bounds for several online variants of bin packing

We consider several previously studied online variants of bin packing an...

A new lower bound for classic online bin packing

We improve the lower bound on the asymptotic competitive ratio of any on...

An Asymptotic Lower Bound for Online Vector Bin Packing

We consider the online vector bin packing problem where n items specifie...

Online Packing to Minimize Area or Perimeter

We consider online packing problems where we get a stream of axis-parall...

Best Fit Bin Packing with Random Order Revisited

Best Fit is a well known online algorithm for the bin packing problem, w...

Fully-Dynamic Bin Packing with Limited Repacking

We consider the bin packing problem in a fully-dynamic setting, where ne...

A tight lower bound for the online bounded space hypercube bin packing problem

In the d-dimensional hypercube bin packing problem, a given list of d-di...