In the divide-the-spoils fairly problem, two thieves have stolen items and want to divide the items fairly between themselves so that difference in the price of items in two groups is minimized. How to solve this?
Divide-the-spoils-fairly : Dynamic Programming (pg 257, python)
It is classic knapsack problem still. My hint is as follows:
Here we wants to one thief what possible values he/she can achieve. Then we check the value around the half of the total values of items.
0 Likes