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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
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 (1997)
Csirik, J., Woeginger, G.J.: On-line packing and covering problems. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms: The State of the Art, pp. 147–177 (1998)
Fernandez de la Vega, W., Lueker, G.S.: Bin packing can be solved within 1 + ε in linear time. Combinatorica 1, 349–355 (1981)
Galambos, G., Woeginger, G.J.: Repacking helps in bounded space online bin packing. Computing 49, 329–338 (1993)
Gambosi, G., Postiglione, A., Talamo, M.: On-line maintenance of an approximate bin-packing solution. Nordic Journal on Computing 4(2), 151–166 (1997)
Gambosi, G., Postiglione, A., Talamo, M.: Algorithms for the relaxed online bin-packing model. SIAM Journal on Computing 30(5), 1532–1551 (2000)
Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. Journal of the ACM 34(1), 144–162 (1987)
Ivkovic, Z., Lloyd, E.L.: Partially dynamic bin packing can be solved within 1 + ε in (amortized) polylogarithmic time. Information Processing Letters 63(1), 45–50 (1997)
Ivkovic, Z., Lloyd, E.L.: Fully dynamic algorithms for bin packing: Being (mostly) myopic helps. SIAM Journal on Computing 28(2), 574–611 (1998)
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 1982), pp. 312–320 (1982)
Lee, C.C., Lee, D.T.: A simple online bin packing algorithm. Journal of the ACM 32(3), 562–572 (1985)
Sanders, P., Sivadasan, N., Skutella, M.: Online scheduling with bounded migration. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 1111–1122. Springer, Heidelberg (2004)
Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons, Chichester (1986)
Seiden, S.S.: On the online bin packing problem. Journal of the ACM 49(5), 640–671 (2002)
Ullman, J.D.: The performance of a memory allocation algorithm. Technical Report 100, Princeton University, Princeton, NJ (1971)
van Vliet, A.: An improved lower bound for online bin packing algorithms. Information Processing Letters 43(5), 277–284 (1992)
Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Epstein, L., Levin, A. (2006). A Robust APTAS for the Classical Bin Packing Problem. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds) Automata, Languages and Programming. ICALP 2006. Lecture Notes in Computer Science, vol 4051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11786986_20
Download citation
DOI: https://doi.org/10.1007/11786986_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35904-3
Online ISBN: 978-3-540-35905-0
eBook Packages: Computer ScienceComputer Science (R0)