First Fit bin packing: A tight analysis

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 20, Issue , 2013, Pages 538-549

  Dsa, György ^a   Sgall, Jir ^b  

^a UNIVERSITY OF PANNONIA   (Hungary)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Approximation algorithms; Bin packing; First Fit; Online algorithms

Indexed keywords

APPROXIMATION RATIOS; ASYMPTOTIC APPROXIMATION; BIN PACKING; BIN PACKING PROBLEM; FIRST FIT; LOWER BOUNDS; ON-LINE ALGORITHMS; UPPER AND LOWER BOUNDS;

APPROXIMATION ALGORITHMS; COMPUTER SCIENCE;

BINS;

EID: 84892596888     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2013.538     Document Type: Conference Paper

References (15)

1. J. Boyar, G. Dósa, and L. Epstein. On the absolute approximation ratio for First Fit and related results. Discrete Appl. Math., 160:1914-1923, 2012
2. E. G. Coffman, M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: A survey. In D. Hochbaum, editor, Approximation algorithms. PWS Publishing Company, 1997
3. G. Dósa. The tight bound of First Fit Decreasing bin-packing algorithm is FFD(I) 11/9OPT(I) + 6/9. In Proc. 1st International Symp. on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE), volume 4614 of Lecture Notes in Comput. Sci., pages 1-11. Springer, 2007
4. M. R. Garey, R. L. Graham, D. S. Johnson, and A. C.-C. Yao. Resource constrained scheduling as generalized bin packing. J. Combin. Theory Ser. A, 21:257-298, 1976
5. M. R. Garey, R. L. Graham, and J. D. Ullman. Worst-case analysis of memory allocation algorithms. In Proc. 4th Symp. Theory of Computing (STOC), pages 143-150. ACM, 1973
6. R. L. Graham. Bounds for certain multiprocessing anomalies. Bell System Technical J., 45:1563-1581, 1966
7. R. L. Graham. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math., 17:263-269, 1969
8. D. S. Johnson. Near-optimal bin packing algorithms. PhD thesis, MIT, Cambridge, MA, 1973
9. D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput., 3:256-278, 1974
10. Z. Németh. A first fit algoritmus abszolút hibájáról (in Hungarian). Eötvös Loránd Univ., Budapest, Hungary, 2011
11. J. Sgall. A new analysis of Best Fit bin packing. In Proc. of 6th Int. Conference FUN with Algorithms, volume 7288 of Lecture Notes in Comput. Sci., pages 315-321. Springer, 2012
12. D. Simchi-Levi. New worst case results for the bin-packing problem. Naval Res. Logist., 41:579-585, 1994
13. J. D. Ullman. The performance of a memory allocation algorithm. Technical Report 100, Princeton Univ., Princeton, NJ, 1971
14. D. P. Williamson and D. B. Shmoys. The Design of Approximation Algorithms. Cambridge University Press, 2011
15. B. Xia and Z. Tan. Tighter bounds of the First Fit algorithm for the bin-packing problem. Discrete Appl. Math., 158:1668-1675, 2010.