Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\) (Q392175): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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: The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A tighter bound for FFd algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: 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 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the machine scheduling problem with job delivery coordination / rank | |||
Normal rank | |||
Latest revision as of 06:04, 7 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\) |
scientific article |
Statements
Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\) (English)
0 references
13 January 2014
0 references
first fit decreasing
0 references
bin packing
0 references
tight bound
0 references
0 references
