Abstract
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an algorithm were given the entire input in advance, it could give an optimal solution (in exponential time). Instead of giving the algorithm more knowledge about the input, in this paper we consider the effects of giving an online bin packing algorithm larger bins than the offline algorithm it is compared to. We give new algorithms for this problem that combine items in bins in an unusual way and give bounds on their performance which improve upon the best possible bounded space algorithm. We also give general lower bounds for this problem which are nearly matching for bin sizes b ≥ 2.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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. (ed.) Dagstuhl Seminar 1996. LNCS, vol. 1442, pp. 147–177. Springer, Heidelberg (1998)
Csirik, J., Woeginger, G.J.: Resource augmentation for online bounded space bin packing. Journal of Algorithms 44(2), 308–320 (2002)
Epstein, L., Seiden, S.S., van Stee, R.: New bounds for variable-sized and resource augmented online bin packing. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 306–317. Springer, Heidelberg (2002)
Garey, M.R., Graham, R.L., Ullman, J.D.: Worst-case analysis of memory allocation algorithms. In: Proceedings of the Fourth Annual ACM Symposium on Theory of Computing, pp. 143–150. ACM, New York (1972)
Johnson, D.S.: Fast algorithms for bin packing. Journal Computer Systems Science 8, 272–314 (1974)
Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. Journal of the ACM 47, 214–221 (2000)
Lee, C.C., Lee, D.T.: A simple online bin packing algorithm. Journal of the ACM 32, 562–572 (1985)
Phillips, C., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. Algorithmica, 163–200 (2002)
Ramanan, P., Brown, D.J., Lee, C.C., Lee, D.T.: Online bin packing in linear time. Journal of Algorithms 10, 305–326 (1989)
Seiden, S.S.: On the online bin packing problem. Journal of the ACM 49(5), 640–671 (2002)
Jeffrey, D.: Ullman. 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, 277–284 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Epstein, L., van Stee, R. (2005). Online Bin Packing with Resource Augmentation. In: Persiano, G., Solis-Oba, R. (eds) Approximation and Online Algorithms. WAOA 2004. Lecture Notes in Computer Science, vol 3351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31833-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-31833-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24574-2
Online ISBN: 978-3-540-31833-0
eBook Packages: Computer ScienceComputer Science (R0)