New answers tagged dynamic-programming
0
votes
Knapsack problem 0/1 with even number of items
Note: At the time of my writing, the only other answer to this question seems incorrect. I do not agree that $DP_\text{e}(0,j) = -\infty$ for all $j > 0$. Whether the backpack is full ($j = 0$) or ...
- 101
0
votes
3 Processor Scheduling
You should be able to do this in exponential time, but much faster than n^3 operations.
Get a quick upper bound by sorting the tasks in descending length, then scheduling each task in turn to the ...
- 28.4k
Top 50 recent answers are included