Abstract
Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as the optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking, i.e., the maximum size packed into any bin.
We give an algorithm for Online Bin Stretching with a stretching factor of \(1.5\) for any number of bins. We also show a specialized algorithm for three bins with a stretching factor of \(11/8 = 1.375\).
M. Böhm, J. Sgall and P. Veselý—Supported by the project 14-10003S of GA ČR and by the GAUK project 548214.
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
References
Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line load balancing with applications to machine scheduling and virtual circuit routing. J. ACM 44, 486–504 (1997)
Azar, Y., Regev, O.: On-line bin-stretching. In: Rolim, J.D.P., Serna, M., Luby, M. (eds.) RANDOM 1998. LNCS, vol. 1518, pp. 71–81. Springer, Heidelberg (1998)
Berman, P., Charikar, M., Karpinski, M.: On-line load balancing for related machines. J. Algorithms 35, 108–121 (2000)
Coffman Jr, E., Csirik, J., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: survey and classification. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 455–531. Springer, New York (2013)
Ebenlendr, T., Jawor, W., Sgall, J.: Preemptive online scheduling: optimal algorithms for all speeds. Algorithmica 53, 504–522 (2009)
Gabay, M., Brauner, N., Kotov, V.: Computing lower bounds for semi-online optimization problems: application to the bin stretching problem. HAL preprint hal-00921663 (2013)
Gabay, M., Kotov, V., Brauner, N.: Semi-online bin stretching with bunch techniques. HAL preprint hal-00869858 (2013)
Johnson, D.: Near-optimal Bin Packing Algorithms. Massachusetts Institute of Technology, project MAC. Massachusetts Institute of Technology (1973)
Kellerer, H., Kotov, V.: An efficient algorithm for bin stretching. Oper. Res. Lett. 41(4), 343–346 (2013)
Kellerer, H., Kotov, V., Speranza, M.G., Tuza, Z.: Semi on-line algorithms for the partition problem. Oper. Res. Lett. 21, 235–242 (1997)
Ullman, J.: The performance of a memory allocation algorithm. Technical report 100 (1971)
Acknowledgment
The authors thank Emese Bittner for useful discussions during her visit to Charles University.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Böhm, M., Sgall, J., van Stee, R., Veselý, P. (2015). Better Algorithms for Online Bin Stretching. In: Bampis, E., Svensson, O. (eds) Approximation and Online Algorithms. WAOA 2014. Lecture Notes in Computer Science(), vol 8952. Springer, Cham. https://doi.org/10.1007/978-3-319-18263-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-18263-6_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18262-9
Online ISBN: 978-3-319-18263-6
eBook Packages: Computer ScienceComputer Science (R0)