A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm
From MaRDI portal
Publication:1916508
DOI10.1007/BF02011198zbMath0856.68073WikidataQ56212222 ScholiaQ56212222MaRDI QIDQ1916508
Publication date: 8 July 1996
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
68W10: Parallel algorithms in computer science
Related Items
A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem, An improved two-machine flowshop scheduling with intermediate transportation, Single-machine scheduling with periodic maintenance to minimize makespan revisited, A 3/2-approximation for big two-bar charts packing, Two-bar charts packing problem, SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN
Cites Work