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

Authors:
János Csirik
Affiliations:
Department of Computer Sciences, József Attila University of Szeged Szeged, Somogyi u. 7, Hungary
Venue:
Operations Research Letters
Year:
1986

Citing 3
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Some unexpected expected behavior results for bin packing

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
An efficient approximation scheme for the one-dimensional bin-packing problem

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 = (a"1, a"2, a"n) are the following: a"i = b with probability 0.5, =1-b with probability 0.5.