The tight bound of first fit decreasing bin-packing algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4614 LNCS, Issue , 2007, Pages 1-11

  Dósa, György ^a  

^a UNIVERSITY OF PANNONIA   (Hungary)

Author keywords

First fit decreasing; Tight bound

Indexed keywords

COMBINATORIAL MATHEMATICS; PROBABILISTIC LOGICS;

BIN-PACKING ALGORITHM; FIRST FIT DECREASING; TIGHT BOUND;

ALGORITHMS;

EID: 38049049887     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74450-4_1     Document Type: Conference Paper

References (6)

1. Li, R., Yue, M.: The proof of FFD(L) ≤ 11/9OPT(L) + 7/9. Chinese Science Bulletin 42(15) (August 1997)
2. Baker, B.S.: A new proof for the first-fit decreasing bin-packing algorithm. J. Algorithms, 49-70 (1985)
3. Coffmann, E.G., Garey Jr., M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survey. In: Hochbaum, D. (ed.) Approximation algorithms for NP-hard problems. PWS Publishing, Boston (1997)
4. Yue, M.: A simple proof of the inequality FFD(L) ≤ 11/9OPT(L) + 1, ∀L, for the FFD bin-packing algorithm. Acta Mathematicae Applicatae Sinica 7(4), 321-331 (1991)
5. Johnson, D.S.: Near-optimal bin-packing algorithms. Doctoral Thesis. MIT Press, Cambridge (1973)
6. Zhong, W., Dosa, Gy., Tan, Z.: On the machine scheduling problem with job delivery coordination. European Journal of Operations Research, online (2006)