Two simple algorithms for bin covering

1999

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

Additional Metadata
Persistent URL	hdl.handle.net/1765/11736
Journal	University of Szeged. Acta Cybernetica
Organisation	Erasmus School of Economics
Citation APA APA Style APA-ALL Style AAA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Frenk, H., Csirik, J., Labbé, M.& Zhang, S. (1999). Two simple algorithms for bin covering. University of Szeged. Acta Cybernetica, 13–25.http://hdl.handle.net/1765/11736

Publication