Bin packing as a random walk: A note on knödel's paper

Research output: Article

2 Citations (Scopus)


We study the asymptotic expected behavior of the FF (first-fit) bin packing algorithm for special stochastic input sequences. It is shown that FF(L)-OFF(L) = O(√n) if the items of L = (a1, a2, an) are the following: ai = b with probability 0.5, =1-b with probability 0.5.

Original languageEnglish
Pages (from-to)161-163
Number of pages3
JournalOperations Research Letters
Issue number3
Publication statusPublished - aug. 1986

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Bin packing as a random walk: A note on knödel's paper'. Together they form a unique fingerprint.

  • Cite this