We define two simple algorithms for the bin covering problem and give their asymptotic performance.

hdl.handle.net/1765/11736
University of Szeged. Acta Cybernetica
Erasmus School of Economics

Frenk, J.B.G, Csirik, J, Labbé, M, & Zhang, S. (1999). Two simple algorithms for bin covering. University of Szeged. Acta Cybernetica, 13–25. Retrieved from http://hdl.handle.net/1765/11736