The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm
From MaRDI portal
Recommendations
- The Asymptotic Worst-Case Behavior of the FFD Heuristic for Small Items
- scientific article; zbMATH DE number 4050974
- Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
- 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
- The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
Cited in
(11)- The class constrained bin packing problem with applications to video-on-demand
- 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
- Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems
- On the Asymptotic Worst Case Behavior of Harmonic Fit
- Parametric on-line algorithms for packing rectangles and boxes.
- Two- and three-dimensional parametric packing
- A-order generation of k-ary trees with a 4k–4 letter alphabet
- Open-end bin packing: new and old analysis approaches
- On lazy bin covering and packing problems
- Worst-case analysis of fast heuristics for packing squares into a square
- More on online bin packing with two item sizes
This page was built for publication: The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3141519)
