Fair versus Unrestricted Bin Packing

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

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review


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.
Original languageEnglish
Title of host publicationAlgorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory
Number of pages14
Publication date2000
Publication statusPublished - 2000
EventSeventh Scandinavian Workshop on Algorithm Theory - Bergen, Norway
Duration: 5. Jul 20007. Jul 2000


ConferenceSeventh Scandinavian Workshop on Algorithm Theory
SeriesLecture Notes in Computer Science


Dive into the research topics of 'Fair versus Unrestricted Bin Packing'. Together they form a unique fingerprint.

Cite this