An asymptotic fully polynomial time approximation scheme for bin covering

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 find 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 this paper we present the first asymptotic fully polynomial-time approximation scheme for the problem.

[1]  G. S. Lueker,et al.  Bin packing can be solved within 1 + ε in linear time , 1981 .

[2]  Susan Fera. Assmann.  Problems in discrete applied mathematics , 1983 .

[3]  Klaus Jansen,et al.  Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function , 2002, IFIP TCS.

[4]  Richard M. Karp,et al.  An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[5]  Hans Kellerer,et al.  A New Fully Polynomial Approximation Scheme for the Knapsack Problem , 1998, APPROX.

[6]  Joseph Y.-T. Leung,et al.  On a Dual Version of the One-Dimensional Bin Packing Problem , 1984, J. Algorithms.

[7]  János Csirik,et al.  Online algorithms for a dual version of bin packing , 1988, Discret. Appl. Math..

[8]  Éva Tardos,et al.  Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..

[9]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[10]  Claire Mathieu,et al.  Better approximation algorithms for bin covering , 2001, SODA '01.

[11]  Eugene L. Lawler,et al.  Fast approximation algorithms for knapsack problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[12]  Leonid Khachiyan,et al.  Coordination Complexity of Parallel Price-Directive Decomposition , 1996, Math. Oper. Res..

[13]  J. B. G. Frenk,et al.  Two Simple Algorithms for bin Covering , 1999, Acta Cybern..

[14]  Leonid Khachiyan,et al.  Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints , 1994, SIAM J. Optim..