New lower bounds for certain classes of bin packing algorithms

Authors:
János Balogh;József Békési;Gábor Galambos
Affiliations:
Department of Applied Informatics, Gyula Juhász Faculty of Education, University of Szeged;Department of Applied Informatics, Gyula Juhász Faculty of Education, University of Szeged;Department of Applied Informatics, Gyula Juhász Faculty of Education, University of Szeged
Venue:
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Year:
2010

Citing 8
Cited 3

Parametric lower bound for on-line bin-packing

SIAM Journal on Algebraic and Discrete Methods
An improved lower bound for on-line bin packing algorithms

Information Processing Letters
A 1.6 lower-bound for the two-dimensional on-line rectangle bin-packing

Acta Cybernetica
A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case

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

Computers and Intractability: A Guide to the Theory of NP-Completeness
On the online bin packing problem

Journal of the ACM (JACM)
New Bounds for Variable-Sized Online Bin Packing

SIAM Journal on Computing
Fast algorithms for bin packing

Journal of Computer and System Sciences

SIGACT news online algorithms column 20: the power of harmony

ACM SIGACT News
A robust AFPTAS for online bin packing with polynomial migration,

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
On-line bin packing with restricted repacking

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

On-line algorithms have been extensively studied for the one-dimensional bin packing problem. In this paper we investigate two classes of the one- dimensional bin packing algorithms, and we give lower bounds for their asymptotic worst-case behaviour. For on-line algorithms so far the best lower bound was given by van Vliet in 1992 [13]. He proved that there is no on-line bin packing algorithm with better asymptotic performance ratio than 1.54014.... In this paper we give an improvement on this bound to 248/161 = 1.54037... and we investigate the parametric case as well. For those lists where the elements are preprocessed according to their sizes in decreasing order Csirik et al. [1] proved that no on-line algorithm can have an asymptotic performance ratio smaller than 8/7. We improve this result to 54/47.