A simple proof of the inequality MFFD(L)≤71/60 OPT(L) + 1,L for the MFFD bin-packing algorithm

1995/07/01 by Minyi Yue, Lei Zhang · 1 citation
Computer Science · Engineering · Mathematics · #Algorithm #Calculus (dental) #Combinatorics #Computer science #Discrete mathematics #Epistemology #Inequality #Mathematics #Optimization and Packing Problems #Optimization and Search Problems #Philosophy #Proof of concept #Simple (philosophy) #graph theory and CDMA systems

paper · doi:10.1007/bf02011198

crossref issued 1995/07/01 · crossref published 1995/07/01 · crossref published-print 1995/07/01 · openalex publication_date 1995/07/01 · crossref created 2005/08/05 · crossref deposited 2020/04/08 · openalex created_date 2025/10/10 · crossref indexed 2026/03/24 · openalex updated_date 2026/07/23

Citations

• A 7160 theorem for bin packing
• On the exact upper bound for the multifit processor scheduling algorithm

Cited by

• Bin packing problem [wikipedia]