Abstract
We define two simple algorithms for the bin covering problem and give their asymptotic performance.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 13-25 |
| Number of pages | 13 |
| Journal | Acta Cybernetica |
| Volume | 14 |
| Issue number | 1 |
| State | Published - Jan 1 1999 |
Fingerprint
Dive into the research topics of 'Two simple algorithms for bin covering'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS