The tight absolute bound of First Fit in the parameterized case

DOI10.1016/j.tcs.2015.06.046zbMath1328.68298OpenAlexW960458449MaRDI QIDQ2355708

György Dósa

Publication date: 24 July 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.06.046

zbMATH Keywords

bin packingFirst Fitabsolute approximation ratio

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (2)

Several methods of analysis for cardinality constrained bin packing ⋮ Several methods of analysis for cardinality constrained bin packing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Resource constrained scheduling as generalized bin packing
• The Design of Approximation Algorithms
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Optimal Analysis of Best Fit Bin Packing

This page was built for publication: The tight absolute bound of First Fit in the parameterized case