The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9

2007/09/14 by György Dósa · 3 citations
Engineering · Mathematics · #Advanced Manufacturing and Logistics Optimization #Algorithm #Bin #Bin packing problem #Combinatorics #Computer science #Constant (computer programming) #Mathematics #Optimization and Packing Problems #Order (exchange) #Upper and lower bounds #graph theory and CDMA systems

paper · doi:10.1007/978-3-540-74450-4_1

openalex publication_date 2007/09/14 · crossref created 2007/09/14 · crossref deposited 2023/05/14 · openalex created_date 2025/10/10 · crossref indexed 2026/07/21 · openalex updated_date 2026/08/04

Cited by

• First Fit bin packing: A tight analysis
• Overcommitment in Cloud Services: Bin Packing with Chance Constraints
• Bin packing problem [wikipedia]