Two simple algorithms for bin covering

Acta Cybernetica

Volumn 14, Issue 1, 1999, Pages 13-25

  Csirik, J ^a   Frenk, J B G ^b   Labbe M ^c   Zhang, S ^b  

^a UNIVERSITY OF SZEGED   (Hungary)

^b ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^c UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042966080     PISSN: 0324721X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (4)

1. Assmann, S.F.: Problems in Discrete Applied Mathematics, Ph.D. Thesis, Mathematics Department, MIT, Cambridge, MA, 1983.
2. Assmann S. F., Johnson D. S., Kleitman D. J., Leung J. Y.-T.: On a dual version of the one-dimensional bin packing problem, J. of Algorithms 5(1984), 502-525.
3. Deyermeyer, B.L., Friesen, D.K., Langston, M.A.: Scheduling to maximize the minimum processor finish time in a multiprocessor system, SIAM J. Alg. Disc. Meth. 3(1982), 190-196.
4. Graham, R.L.: Bounds on multiprocessing timing anomalies, SIAM J. Appl. Math. 17(1969), 263-269.