A simple proof of the inequality \(\text{FFD}(L)\leq {11 \over 9} \text{OPT}(L)+1\), \(\forall L\) for the FFD bin-packing algorithm
type: Item
instance of: scholarly article
title: A simple proof of the inequality \(\text{FFD}(L)\leq {11 \over 9} \text{OPT}(L)+1\), \(\forall L\) for the FFD bin-packing algorithm
zbMATH Open document ID: 0753.05022
DOI: 10.1007/BF02009683
author: Minyi Yue
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 05B40
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 90125
zbMATH Keywords: bin-packing algorithm
zbMATH Keywords: first fit decreasing algorithm
MaRDI profile type: Publication
Wikidata QID: Q56212216
cites work: A new proof for the first-fit decreasing bin-packing algorithm
cites work: An Application of Bin-Packing to Multiprocessor Scheduling
full work available at URL: https://doi.org/10.1007/bf02009683
OpenAlex ID: W4238573359
description: scientific article; zbMATH DE number 90125