Article ID Journal Published Year Pages File Type
421280 Discrete Applied Mathematics 2010 8 Pages PDF
Abstract

In this paper, we present improved bounds for the First Fit algorithm for the bin-packing problem. We prove CFF(L)≤1710C∗(L)+710 for all lists LL, and the absolute performance ratio of FFFF is at most 127.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Tighter bounds of the First Fit algorithm for the bin-packing problem
Authors
, ,