HomeworkLib
Question

True or False: A greedy approach is guaranteed to find the optimal solution to the Knapsack...

True or False: A greedy approach is guaranteed to find the optimal solution to the Knapsack 0-1 problem.

True
False
engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1 
A greedy approach is does not guaranteed to find the optimal solution to the Knapsack 0-1 problem

False

0 0
Add a comment
Know the answer?
Add Answer to:
True or False: A greedy approach is guaranteed to find the optimal solution to the Knapsack...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • There is no known Greedy strategy that is optimal for solving the 0/1 Knapsack problem. For...

    There is no known Greedy strategy that is optimal for solving the 0/1 Knapsack problem. For each of the following strategies give a counterexample, i.e. descibe an instance where that strategy will fail to produce an optimal result. (a) Lightest item first. (b)Most valuable item first. (c)Item with the best value to weight ratio first.

  • For given capacity of knapsack W and n items {i1,i2,...,in} with its own value {v1,v2,...,vn} and...

    For given capacity of knapsack W and n items {i1,i2,...,in} with its own value {v1,v2,...,vn} and weight {w1,w2,...,wn}, find a greedy algorithm that solves fractional knapsack problem, and prove its correctness. And, if you naively use the greedy algorithm to solve 0-1 knapsack problem with no repetition, then the greedy algorithm does not ensure an optimal solution anymore. Give an example that a solution from the greedy algorithm is not an optimal solution for 0-1 knapsack problem.

  • Consider the following greedy algorithm for the knapsack problem: each time we pick the item with...

    Consider the following greedy algorithm for the knapsack problem: each time we pick the item with the highest value to weight ratio to the bag. Skip items that will make the total weight exceeded the capacity of the bag. Find a counterexample to show that this approach will not work, and the result could be 100 times worse than the optimal solution. That is, construct a table of set of items with weight and values and find a bag capacity...

  • algorithm TRUE OR FALSE       TRUE OR FALSE    Optimal substructure applies to alloptimization problems.  ...

    algorithm TRUE OR FALSE       TRUE OR FALSE    Optimal substructure applies to alloptimization problems.     TRUE OR FALSE    For the same problem, there might be different greedy algorithms each optimizes a different measure on its way to a solutions.      TRUE OR FALSE Computing the nth Fibonacci number using dynamic programming with bottom-upiterations takes O(n) while it takes O(n2) to compute it using the top-down approach. TRUE OR FALSE Every computational problem on input size n can be...

  • Local Search Knapsack 0-1

    Design a local search algorithm for the 0-1 knapsack problem. Assume there are n items x1 ... xn each with weight wi and value vi. The knapsack can have at most one of each item and the total weight cannot exceed W. You want to maximize the total value in the knapsack.Question 1: (7 points) Show the psuedocode/explanation for your algorithm.Question 2. (3 points) Is it guaranteed to find an optimal solution? Justify your answer.

  • solution is required in pseudo code please. 2 Knapsack Problem În al Knapsack problem. given n items(11-12. . . ....

    solution is required in pseudo code please. 2 Knapsack Problem În al Knapsack problem. given n items(11-12. . . . . 1"} with weight {w1·W2. . . . . ux) and value (n 2, .., nJ, the goal is to select a combination of items such that the total value V is maximized and the total weight is less or equal to a given capacity In this question, we will consider two different ways to represent a solution to the...

  • Find an optimal solution to the knapsack instance n = 8 Capacity m = 47 Profits...

    Find an optimal solution to the knapsack instance n = 8 Capacity m = 47 Profits (p1,p2,...,p8) = (13,20,27,51,42,30,17,39) Weights (w1,w2,...,w8) = (4,4,9,15,11,8,8,10)

  • In 0-1 Knapsack Problem, what is maximized in the optimal solution? A.) Total Value B.) Total...

    In 0-1 Knapsack Problem, what is maximized in the optimal solution? A.) Total Value B.) Total Weight C.) Total number of Items D.) Total Volume of Items E.) Total Value/ Total Weight

  • Consider the integer knapsack problem. Give a recursive algorithm (call it Find-Optimal-Subset) that finds the optimal...

    Consider the integer knapsack problem. Give a recursive algorithm (call it Find-Optimal-Subset) that finds the optimal subset of items through post-processing, that is, after filling in the memorization table to find the maximum total value of the optimal subset of items. (The algorithm we studied in class finds only the maximum total value, not the actual optimal subset of items.) Hint: Trace back through the array M[0..n,0..W] following the optimal structure.

  • The fractional knapsack problem may be solved optimally by a greedy method by taking a fraction...

    The fractional knapsack problem may be solved optimally by a greedy method by taking a fraction of no more than this number of items. A. 1 B. 2 C. 3 D. 4

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT