Pages that link to "Item:Q3677174"
From MaRDI portal
The following pages link to A new proof for the first-fit decreasing bin-packing algorithm (Q3677174):
Displayed 10 items.
- Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\) (Q392175) (← links)
- Tighter bounds of the First Fit algorithm for the bin-packing problem (Q602685) (← links)
- A 71/60 theorem for bin packing (Q1083194) (← links)
- Parallel approximation algorithms for bin packing (Q1123807) (← links)
- 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 (Q1198607) (← links)
- The FFD algorithm for the bin packing problem with kernel items (Q1272734) (← links)
- Worst-case analysis of fast heuristics for packing squares into a square (Q1365944) (← links)
- The proof of \(\text{FFD}(L)\leq\frac{11}9\text{OPT}(L)+\frac79\) (Q1373809) (← links)
- A tighter bound for FFd algorithm (Q1594856) (← links)
- A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm (Q1916508) (← links)