Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survey. In: Hochbaum, D. (ed.) Approximation Algorithms. PWS Publishing Company, Boston (1997)
Csirik J. and Woeginger G.J. (1998). On-line packing and covering problems. In: Fiat, A. and Woeginger, G.J. (eds) Online Algorithms: The State of the Art, pp 147–177. Springer-Verlag, Berlin
Fernandez de la Vega W. and Lueker G.S. (1981). Bin packing can be solved within \(1 + \varepsilon\) in linear time. Comb. 1: 349–355
Galambos G. and Woeginger G.J. (1993). Repacking helps in bounded space online bin packing. Comput. 49: 329–338
Gambosi G., Postiglione A. and Talamo M. (1997). Online maintenance of an approximate bin-packing solution. Nord. J. Comput. 4(2): 151–166
Gambosi G., Postiglione A. and Talamo M. (2000). Algorithms for the relaxed online bin-packing model. SIAM J. Comput. 30(5): 1532–1551
Hochbaum D.S. and Shmoys D.B. (1987). Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. ACM 34(1): 144–162
Ivkovic Z. and Lloyd E.L. (1997). Partially dynamic bin packing can be solved within 1 + \(\varepsilon\) in (amortized) polylogarithmic time. Inf Process Lett 63(1): 45–50
Ivkovic Z. and Lloyd E.L. (1998). Fully dynamic algorithms for bin packing: being (mostly) myopic helps. SIAM J. Comput. 28(2): 574–611
Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin- packing problem. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS’82), pp. 312–320 (1982)
Lee C.C. and Lee D.T. (1985). A simple online bin packing algorithm. J. ACM 32(3): 562–572
Sanders, P., Sivadasan, N., Skutella, M.: Online scheduling with bounded migration. In: Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP2004), pp. 1111–1122 (2004)
Schrijver A. (1986). Theory of Linear and Integer Programming. Wiley, New york
Seiden S.S. (2002). On the online bin packing problem. J. ACM 49(5): 640–671
Ullman J.D. (1971). The performance of a memory allocation algorithm. Technical Report 100. Princeton University, Princeton
van Vliet A. (1992). An improved lower bound for online bin packing algorithms. Inf. Process. Lett. 43(5): 277–284
Vazirani V.V. (2001). Approximation Algorithms. Springer, Heidelberg
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this paper appeared in Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP2006), part I, pp. 214–225.
Rights and permissions
About this article
Cite this article
Epstein, L., Levin, A. A robust APTAS for the classical bin packing problem. Math. Program. 119, 33–49 (2009). https://doi.org/10.1007/s10107-007-0200-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-007-0200-y