A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm (Q1916508): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56212222 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new proof for the first-fit decreasing bin-packing algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A 71/60 theorem for bin packing / rank | |||
Normal rank | |||
Latest revision as of 13:15, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm |
scientific article |
Statements
A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm (English)
0 references
8 July 1996
0 references
bin-packing
0 references
MFFD
0 references
FFD algorithm
0 references
