The tight bound of first fit decreasing bin-packing algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9

Research output: Chapter in Book/Report/Conference proceedingConference contribution

74 Citations (Scopus)

Abstract

First Fit Decreasing is a classical bin packing algorithm: the items are ordered into their nonincreasing order, and then in this order the next item is always packed into the first bin where it fits. For an instance I let FFD(I) and OPT(I) denote the number of the used bins by algorithm FFD, and an optimal algorithm, respectively. We show in this paper that FFD(I) ≤ 11/9OPT(Z) + 6/9, (1) and that this bound is tight. The tight bound of the additive constant was an open question for many years.

Original languageEnglish
Title of host publicationCombinatorics, Algorithms, Probabilistic and Experimental Methodologies - First International Symposium, ESCAPE 2007, Revised Selected Papers
Pages1-11
Number of pages11
Publication statusPublished - Dec 1 2007
Event1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, ESCAPE 2007 - Hangzhou, China
Duration: Apr 7 2007Apr 9 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4614 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, ESCAPE 2007
CountryChina
CityHangzhou
Period4/7/074/9/07

    Fingerprint

Keywords

  • First fit decreasing
  • Tight bound

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Dósa, G. (2007). The tight bound of first fit decreasing bin-packing algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9. In Combinatorics, Algorithms, Probabilistic and Experimental Methodologies - First International Symposium, ESCAPE 2007, Revised Selected Papers (pp. 1-11). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4614 LNCS).