| Informatikai Tanszékcsoport>>> Oktatás>>> | In English |
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins
Leah Epstein 1, and Lene M. Favrholdt 2
Acta Cybernetica 16 (2003) 57-66.
Abstract:
We study an on-line bin packing problem. A fixed number
of bins, possibly of different sizes, are
given. The items arrive on-line, and the goal is to pack
as many items as possible. It is known that there exists
a legal packing of the whole sequence in the
bins. We consider fair algorithms that reject
an item, only if it does not fit in the empty space of
any bin. We show that the competitive ratio of any fair,
deterministic algorithm lies between 
and 
, and that a class of
algorithms including Best-Fit has a competitive ratio of
exactly 
.
Footnotes
School of Computer Science, The Interdisciplinary Center, Herzliya, Israel. Email: lea@idc.ac.il. Research supported in part by the Israel Science Foundation, (grant No. 250/01-1)
Department of Mathematics and Computer Science, University of Southern Denmark. Email: lenem@imada.sdu.dk. Supported in part by the Danish Natural Science Research Council (SNF) and in part by the Future and Emerging Technologies program of the EU under contract number IST-1999-14186 (ALCOM-FT).
Web administrator 2003-10-13