Bounds for online bin packing with cardinality constraints
Abstract We study a bin packing problem in which a bin can contain at most k items of total size at most 1, where k ≥ 2 is a given parameter. Items are presented one by one in an online fashion. We analyze the best absolute competitive ratio of the problem and prove tight bounds of 2 for any k ≥ 4 ....
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2016
|
| Sorozat: | INFORMATION AND COMPUTATION
249 |
| Tárgyszavak: | |
| doi: | 10.1016/j.ic.2016.06.001 |
| mtmt: | 3076541 |
| Online Access: | http://publicatio.bibl.u-szeged.hu/28450 |