Abstract
We analyze approximation algorithms for bounded-space bin packing by comparing them against the optimal bounded-space packing (instead of comparing them against the globally optimal packing that does not necessarily satisfy the bounded-space constraint). For 2-bounded-space bin packing we construct a polynomial time offline approximation algorithm with asymptotic worst case ratio 3/2, and we show a lower bound of 5/4 for this scenario. We show that no 2-bounded-space online algorithm can have an asymptotic worst case ratio better than 4/3. © 2011 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Chrobak, M., Sgall, J., & Woeginger, G. J. (2011). Two-Bounded-Space bin packing revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6942 LNCS, pp. 263–274). https://doi.org/10.1007/978-3-642-23719-5_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
