Sciweavers

DAM
2010
79views more  DAM 2010»
14 years 16 days ago
On the sum minimization version of the online bin covering problem
Given a set of m identical bins of size 1, the online input consists of a (potentially, infinite) stream of items in (0, 1]. Each item is to be assigned to a bin upon arrival. The ...
János Csirik, Leah Epstein, Csanád I...