Tight absolute bound for First Fit Decreasing bin-packing: FFD(L)≤11/9OPT(L)+6/9

Authors:
György Dósa;Rongheng Li;Xin Han;Zsolt Tuza
Affiliations:
Department of Mathematics, University of Pannonia, Veszprém, Hungary;College of Mathematics and Computer Science, Hunan Normal University, Changsha 410081, China;School of Software of Dalian University of Technology, China;Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, Hungary and Department of Computer Science and Systems Technology, University of Pannonia, Veszprém, ...
Venue:
Theoretical Computer Science
Year:
2013

Citing 2
Cited 0

Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
The tight bound of first fit decreasing bin-packing algorithm is FFD(I) ≤ 11/9OPT(I) + 6/9

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Quantified Score

Hi-index	5.23

Visualization

Abstract

First Fit Decreasing is a classical bin-packing algorithm: the items are ordered by non-increasing size, and then in this order the next item is always packed into the first bin where it fits. For an instance L let FFD(L) and OPT(L) denote the number of bins used by algorithm FFD and by an optimal algorithm, respectively. In this paper we give the first complete proof of the inequalityFFD(L)=