A linear approximation algorithm for bin packing with absolute approximation factor 3/2

Science of Computer Programming

Volumn 48, Issue 1, 2003, Pages 67-80

  Berghammer, Rudolf ^a   Reuter, Florian ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

Approximation algorithm; Bin packing; Formal program development

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; REAL TIME SYSTEMS;

BIN PACKING;

COMPUTER PROGRAMMING;

EID: 0038180983     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6423(03)00011-X     Document Type: Article

References (9)

1. Apt K.R., Olderog E.-R. Verification of Sequential and Concurrent Programs. 1991;Springer, Berlin.
2. Coffmann E.G. Jr., Garay M.R., Johnson D.S. Approximation algorithms for bin packing: a survey. Hochbaum D.S. Approximation Algorithms for. NP -Hard Problems:1996;46-93 PWS Publishers.
3. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1990;The MIT Press, Cambridge.
4. Dijkstra E.W. A Discipline of Programming. 1976;Prentice-Hall, Englewood Cliffs, NJ.
5. Gries D. The Science of Computer Programming. 1981;Springer, Berlin.
6. C. Morgan, T. Vickers (Eds.), On the refinement calculus, Formal Approaches to Computing and Information Technology, Springer, Berlin, 1992.
7. F. Reuter, On the formal specification and derivation of approximation algorithms using assertions, Diploma Thesis, Inst. für Informatik und Praktische Mathematik, Universität Kiel, 2000, in German.
8. Simchi-Levi D. New worst-case results for the bin packing problem. Nav. Res. Logist. 41:1994;479-485.
9. F. de la Vega, Luecker G.S. Bin packing can be solved within. (1+) in linear time Combinatorica. 4:1981;349-355.