1
vote
Accepted
First-Fit-Decreasing algorithm packs items of size at most 1 into bins of capacity 2
Suppose we have used First-Fit-Decreasing algorithm to open $\ell$ bins.
Consider any used bin except the last one. Name it $B$.
Consider the moment the total piece size of $B$ became greater than $1$,...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
algorithm-analysis × 1966algorithms × 952
runtime-analysis × 580
time-complexity × 219
asymptotics × 208
sorting × 158
complexity-theory × 143
graphs × 139
data-structures × 125
recurrence-relation × 97
loops × 85
recursion × 80
search-algorithms × 63
amortized-analysis × 62
correctness-proof × 54
randomized-algorithms × 51
approximation × 44
big-o-notation × 43
average-case × 42
quicksort × 41
arrays × 37
proof-techniques × 34
greedy-algorithms × 34
dynamic-programming × 32
probability-theory × 32