Note
Online algorithms for a dual version of bin packing

https://doi.org/10.1016/0166-218X(88)90052-2Get rights and content
Under an Elsevier user license
open archive

Abstract

It is shown that for the dual version of bin packing defined by Assmann et al. no online algorithm can have a performance ratio better than 12. For uniformly distributed elements we give an asymptotically optimal algorithm.

Cited by (0)