A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case
- 26 January 1993
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 41 (2) , 173-178
- https://doi.org/10.1016/0166-218x(93)90037-o
Abstract
No abstract availableKeywords
All Related Versions
This publication has 5 references indexed in Scilit:
- Parametric Lower Bound for On-Line Bin-PackingSIAM Journal on Algebraic Discrete Methods, 1986
- A simple on-line bin-packing algorithmJournal of the ACM, 1985
- A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-PackingSIAM Journal on Algebraic Discrete Methods, 1981
- New Algorithms for Bin PackingJournal of the ACM, 1980
- A lower bound for on-line bin packingInformation Processing Letters, 1980