Some unexpected expected behavior results for bin packing

44Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study the asymptotic expected behavior of the First Fit and First Fit Decreasing bin packing algorithms applied to items chosen uniformly from the interval (0,u], u ≤1. Our results indicate that the algorithms perform even better than previously expected.

Cite

CITATION STYLE

APA

Bentley, J. L., Johnson, D. S., Leighton, F. T., McGeoch, C. C., & McGeoch, L. A. (1984). Some unexpected expected behavior results for bin packing. In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 279–288). Association for Computing Machinery. https://doi.org/10.1145/800057.808692

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free