An asymptotic fully polynomial time appr
β
Klaus Jansen; Roberto Solis-Oba
π
Article
π
2003
π
Elsevier Science
π
English
β 175 KB
In the bin covering problem there is a group L = (a1; : : : ; an) of items with sizes s(ai) β (0; 1), and the goal is to ΓΏnd a packing of the items into bins to maximize the number of bins that receive items of total size at least 1. This is a dual problem to the classical bin packing problem. In th