scientific article; zbMATH DE number 1560341

MaRDI QIDQ4527192zbMATH OpenFDO

Authors Martin Fürer

Publication date 13 January 2002

zbMATH Keywords

approximation algorithmsbin packingfirst fit

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Tighter bounds of the First Fit algorithm for the bin-packing problem
• scientific article; zbMATH DE number 6678949
• The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
• Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
• The tight absolute bound of First Fit in the parameterized case

Cited in

(9)

• A 71/60 theorem for bin packing
• The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints
• The tight absolute bound of First Fit in the parameterized case
• scientific article; zbMATH DE number 6678949 (Why is no real title available?)
• The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
• Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
• On the absolute approximation ratio for first fit and related results
• scientific article; zbMATH DE number 3997164 (Why is no real title available?)
• Tighter bounds of the First Fit algorithm for the bin-packing problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4527192)