A simple proof of the inequality FFD (L) ≤ 11/9 OPT (L) + 1, ∀L for the FFD bin-packing algorithm
- 1 October 1991
- journal article
- research article
- Published by Springer Science and Business Media LLC in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 7 (4), 321-331
- https://doi.org/10.1007/bf02009683
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- A new proof for the first-fit decreasing bin-packing algorithmJournal of Algorithms, 1985
- An Application of Bin-Packing to Multiprocessor SchedulingSIAM Journal on Computing, 1978