Lower bounds for several online variants of bin packing

Asaf Levin; Gy\"orgy D\'osa; J\'anos Balogh; J\'ozsef B\'ek\'esi; Leah Epstein

arxiv: 1708.03228 · v1 · pith:UTA4TZKMnew · submitted 2017-08-10 · 💻 cs.DS · cs.DM· math.CO· math.OC

Lower bounds for several online variants of bin packing

J\'anos Balogh , J\'ozsef B\'ek\'esi , Gy\"orgy D\'osa , Leah Epstein , Asaf Levin This is my paper

classification 💻 cs.DS cs.DMmath.COmath.OC

keywords loweronlinepackingasymptoticboundscompetitiveseveralvariants

0 comments

read the original abstract

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.

This paper has not been read by Pith yet.

Lower bounds for several online variants of bin packing

discussion (0)