The following pages link to A tighter bound for FFd algorithm (Q1594856):
Displaying 4 items.
- Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\) (Q392175) (← links)
- Efficient algorithms to decide tightness (Q3132845) (← links)
- A Tight Bound for EMAC (Q3591444) (← links)
- The Asymptotic Worst-Case Behavior of the FFD Heuristic for Small Items (Q4521514) (← links)
