A lower bound for on-line bin packing
Author:
- Frank M. LiangFLFrank M. Liang
- 1 March 1980
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 10 (2) , 76-79
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- New Algorithms for Bin PackingJournal of the ACM, 1980
- Worst-Case Performance Bounds for Simple One-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1974