Tight results for Next Fit and Worst Fit with resource augmentation

Theoretical Computer Science

Volumn 411, Issue 26-28, 2010, Pages 2572-2580

  Boyar, Joan ^a   Epstein, Leah ^b   Levin, Asaf ^c  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^b UNIVERSITY OF HAIFA   (Israel)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Bin packing; Next Fit; Resource augmentation; Worst Fit

Indexed keywords

APPROXIMATION RATIOS; ASYMPTOTIC APPROXIMATION; ASYMPTOTIC PERFORMANCE; BIN PACKING; BIN PACKING PROBLEM; OPTIMAL PACKING; RESOURCE AUGMENTATION; SIMPLE ALGORITHM;

ASYMPTOTIC ANALYSIS; BINS;

APPROXIMATION ALGORITHMS;

EID: 77953290226     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.03.019     Document Type: Article

References (11)

1. Borodin A., and El-Yaniv R. Online Computation and Competitive Analysis (1998), Cambridge University Press
2. J. Boyar, G. Dósa, L. Epstein, On the absolute approximation ratio of well-known bin packing algorithms, Manuscript 2009 (submitted for publication).
3. Coffman Jr. E.G., and Csirik J. Performance guarantees for one-dimensional bin packing. In: Gonzalez T.F. (Ed). Handbook of Approximation Algorithms and Metaheuristics (2007), Chapman & Hall/Crc 18 pages (Chapter 32)
4. Csirik J., and Woeginger G.J. On-line packing and covering problems. In: Fiat A., and Woeginger G.J. (Eds). Online Algorithms: The State of the Art (1998) 147-177
5. Csirik J., and Woeginger G.J. Resource augmentation for online bounded space bin packing. Journal of Algorithms 44 2 (2002) 308-320
6. Epstein L., and van Stee R. Online bin packing with resource augmentation. Discrete Optimization 4 3-4 (2007) 322-333
7. Johnson D.S. Fast algorithms for bin packing. Journal of Computer and System Sciences 8 (1974) 272-314
8. Johnson D.S., Demers A., Ullman J.D., Garey M.R., and Graham R.L. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing 3 (1974) 256-278
9. Kalyanasundaram B., and Pruhs K. Speed is as powerful as clairvoyance. Journal of the ACM 47 4 (2000) 617-643
10. Lee C.C., and Lee D.T. A simple online bin packing algorithm. Journal of the ACM 32 3 (1985) 562-572
11. J.D. Ullman, The performance of a memory allocation algorithm, Technical Report 100, Princeton University, Princeton, NJ, 1971.