Question: Set-partition problem, given a set S = {a 1 , a 2 , , a n } of positive integers (denoting asset values), requires partitioning
- Set-partition problem, given a set S = {a1, a2, , an} of positive integers (denoting asset values), requires partitioning into subsets S1 and S2 that minimizes the difference in the total values of S1 and S2. However all the assets are held in cash: each asset is either a $100, $10, or a $1 bill.
- Identify a greedy procedure to accomplish cash-Set-partitioning. In particular, clearly articulate the i-th step: which asset is allocated, to which set, and why? (7 pts)
b. Does your procedure always produce the best partitioning? Either reason that or provide a counter-example
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
