Two-bounded-space bin packing revisited

Authors:
Marek Chrobak;Jiří Sgall;Gerhard J. Woeginger
Affiliations:
Department of Computer Science, University of California, Riverside;Department of Applied Mathematics, Charles University, Prague, Czech Republic;Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands
Venue:
ESA'11 Proceedings of the 19th European conference on Algorithms
Year:
2011

Citing 5
Cited 1

A simple on-line bin-packing algorithm

Journal of the ACM (JACM)
On the worst-case performance of the NKF bin-packing heuristic

Acta Cybernetica
Tight worst-case performance bounds for next-k-fit bin packing

SIAM Journal on Computing
Improved space for bounded-space, on-line bin-packing

SIAM Journal on Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

SIGACT news online algorithms column 20: the power of harmony

ACM SIGACT News

Quantified Score

Hi-index	0.00

Visualization

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.