Question: Consider the problem LOAD-BALANCING, where one is given a set of n jobs of positive sizes T = {t1, t2,..., tn} and W, and
Consider the problem LOAD-BALANCING, where one is given a set of n jobs of positive sizes T = {t1, t2,..., tn} and W, and must determine if it is possible to split these jobs into two disjoint subsets T, T such that ter t W. Prove that LOAD-BALANCING is NP-complete. Hint: Give a reduction from SUBSET-SUM.
Step by Step Solution
3.48 Rating (155 Votes )
There are 3 Steps involved in it
To prove that the LOADBALANCING problem is NPcomplete we need to demonstrate two things 1 LOADBALANCING is in NP 2 LOADBALANCING is NPhard by reducing a known NPcomplete problem to it The hint suggest... View full answer
Get step-by-step solutions from verified subject matter experts
