A robust APTAS for the classical bin packing problem

Bin packing is a well studied problem which has many applications. In this paper we design a robust APTAS for the problem. The robust APTAS receives a single input item to be added to the packing at each step. It maintains an approximate solution throughout this process, by slightly adjusting the solution for each new item. At each step, the total size of items which may migrate between bins must be bounded by a constant factor times the size of the new item. We show that such a property cannot be maintained with respect to optimal solutions.

[1]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[2]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

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

[4]  André van Vliet,et al.  An Improved Lower Bound for On-Line Bin Packing Algorithms , 1992, Inf. Process. Lett..

[5]  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).

[6]  Gerhard J. Woeginger,et al.  On-line Packing and Covering Problems , 1996, Online Algorithms.

[7]  Giorgio Gambosi,et al.  Algorithms for the Relaxed Online Bin-Packing Model , 2000, SIAM J. Comput..

[8]  Steven S. Seiden,et al.  On the online bin packing problem , 2001, JACM.

[9]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[10]  Martin Skutella,et al.  Online Scheduling with Bounded Migration , 2004, ICALP.

[11]  Gerhard J. Woeginger,et al.  Repacking helps in bounded space on-line bind-packing , 1993, Computing.

[12]  D. T. Lee,et al.  A simple on-line bin-packing algorithm , 1985, JACM.

[13]  Errol L. Lloyd,et al.  Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps , 1993, SIAM J. Comput..

[14]  Jeffrey D. Ullman,et al.  The performance of a memory allocation algorithm , 1971 .

[15]  Errol L. Lloyd,et al.  Partially Dynamic bin Packing can be Solved Within 1 + \varepsilon in (Amortized) Polylogarithmic Time , 1997, Inf. Process. Lett..

[16]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[17]  Giorgio Gambosi,et al.  On-Line Maintenance of an Approximate Bin-Packing Solution , 1997, Nord. J. Comput..