## Abstract

We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer parameter k≥1 and an integer bin size B≥k. The goal is to assign the items (or a subset of the items) into a maximum number of subsets of at least B items each, such that in each such subset the total number of distinct colors of items is at least k. We study both the offline and the online variants of this problem. We first design an optimal polynomial time algorithm for the offline problem. For the online problem we give a lower bound of 1+H_{k-1} (where H_{k-1} denotes the (k-1)-th harmonic number), and an O(k)-competitive algorithm. Finally, we analyze the performance of the natural heuristic First fit.

Original language | English |
---|---|

Pages (from-to) | 246-260 |

Number of pages | 15 |

Journal | Theory of Computing Systems |

Volume | 46 |

Issue number | 2 |

DOIs | |

State | Published - Feb 2010 |

### Bibliographical note

Funding Information:This research has been partially supported by the Hungarian National Foundation for Scientific Research, Grant F048587.

## Keywords

- Bin covering
- Online algorithms

## ASJC Scopus subject areas

- Theoretical Computer Science
- Computational Theory and Mathematics