论文信息 - An Improved Lower Bound for On-Line Bin Packing Algorithms

An Improved Lower Bound for On-Line Bin Packing Algorithms

Abstract In 1980 Liang proved that every on-line algorithm for the bin packing problem has an asymptotic worst case ratio of at least 1.536…. In this paper we give an improved lower bound of 1.540….For the parametric case where all items are smaller than or equal to 1/r, rϵ N +, we also give improved lower bounds.

André van Vliet | A. V. Vliet

[1] G Galambos. Parametric lower bound for on-line bin-packing , 1986 .

[2] D. T. Lee,et al. A simple on-line bin-packing algorithm , 1985, JACM.

[3] D. T. Lee,et al. On-Line Bin Packing in Linear Time , 1989, J. Algorithms.

[4] Frank M. Liang. A Lower Bound for On-Line Bin Packing , 1980, Inf. Process. Lett..

[5] J. B. G. Frenk,et al. A Simple Proof of Liang's Lower Bound for On-Line bin Packing and the Extension to the Parametric Case , 1993, Discret. Appl. Math..

[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .