Question: Which one is true for the Greedy Algorithm for Fractional Knapsack Problem? a . Generates a close to optimum solution in polynomial time. b .
Which one is true for the Greedy Algorithm for Fractional Knapsack Problem?
a Generates a close to optimum solution in polynomial time.
b Finds the global optimum for any input instance.
c Remaining volume is always zero in the solution.
d It runs in exponential time when it finds the global optimum.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
