A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm
type: Item
instance of: scholarly article
title: A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm
zbMATH Open document ID: 0856.68073
DOI: 10.1007/BF02011198
author: Minyi Yue
author: Lei Zhang
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 1996-07-08T00:00:00Z
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 898227
zbMATH Keywords: bin-packing
zbMATH Keywords: MFFD
zbMATH Keywords: FFD algorithm
Wikidata QID: Q56212222
MaRDI profile type: Publication
cites work: A new proof for the first-fit decreasing bin-packing algorithm
cites work: A 71/60 theorem for bin packing
Recommended article: 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
Recommended article: Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
Recommended article: The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
Recommended article: A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case
Recommended article: A tight lower bound for optimal bin packing
Recommended article: A new proof for the first-fit decreasing bin-packing algorithm
Recommended article: FFD bin packing for item sizes with uniform distributions on \([0,\frac12]\).
Recommended article: An improved lower bound for the bin packing problem
Recommended article: The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
Recommended article: Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations
description: scientific article; zbMATH DE number 898227