2000 character limit reached
Lower bounds for several online variants of bin packing (1708.03228v1)
Published 10 Aug 2017 in cs.DS, cs.DM, math.CO, and math.OC
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.