Fair versus Unrestricted Bin Packing

Yossi Azar, Joan Boyar, Lene Monrad Favrholdt, Kim Skak Larsen, Morten N. Nielsen

Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Abstrakt

We consider the Unrestricted Bin Packing problem where we have bins of equal size and a sequence of items. The goal is to maximize the number of items that are packed in the bins by an on-line algorithm. We investigate the power of performing admission control on the items, i.e., rejecting items while there is enough space to pack them, versus behaving fairly, i.e., rejecting an item only when there is not enough space to pack it. We show that by performing admission control on the items, we get better performance for various measures compared with the performance achieved on the fair version of the problem. Our main result shows that we can pack 2/3 of the items for sequences in which the optimal can pack all the items.
OriginalsprogEngelsk
TitelAlgorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory
Antal sider14
Publikationsdato2000
Sider200-213
DOI
StatusUdgivet - 2000
BegivenhedSeventh Scandinavian Workshop on Algorithm Theory - Bergen, Norge
Varighed: 5. jul. 20007. jul. 2000

Konference

KonferenceSeventh Scandinavian Workshop on Algorithm Theory
LandNorge
ByBergen
Periode05/07/200007/07/2000
NavnLecture Notes in Computer Science
Vol/bind1851

Fingeraftryk

Dyk ned i forskningsemnerne om 'Fair versus Unrestricted Bin Packing'. Sammen danner de et unikt fingeraftryk.

Citationsformater