Tighter bounds of the First Fit algorithm for the bin-packing problem

Authors:
Binzhou Xia;Zhiyi Tan
Affiliations:
Department of Mathematics, Zhejiang University, Hangzhou 310027, PR China and School of Mathematical Sciences, Peking University, Beijing 100871, PR China;Department of Mathematics, State Key Lab of CAD & CG, Zhejiang University, Hangzhou 310027, PR China
Venue:
Discrete Applied Mathematics
Year:
2010

Citing 1
Cited 2

Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems

On the absolute approximation ratio for First Fit and related results

Discrete Applied Mathematics
Bin packing with "Largest In Bottom" constraint: tighter bounds and generalizations

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper, we present improved bounds for the First Fit algorithm for the bin-packing problem. We prove C^F^F(L)@?1710C^*(L)+710 for all lists L, and the absolute performance ratio of FF is at most 127.