Question: Consider the greedy algorithm for the knapsack problem: Sort the objects by decreasing ratio of profit to size, and then greedily pick objects in this

Consider the greedy algorithm for the knapsack problem: Sort the objects by decreasing ratio of profit to size, and then greedily pick objects in this order. Show that this algorithm does not have a constant approximation ratio (Hint: Construct an example where the ratio depends on the input. Easy)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

P1 (4 pts) Given this solution information, for the unbounded Knapsack problem below, recover the choices that gave the optimal answer for knapsack capacity 19. Show your work (highlight or circle...

4. Consider the following variant of string alignment: given two strings x, y, and a positive integer L, find all contiguous substrings of length at least L that are aligned (using no-ops...

b) (10 pts) Give an algorithm that solves this problem. You may use/modify/refer to the pseudocode for Knapsack from the lecture notes (below). 4. Consider the following variant of string alignment:...

Knapsack Problem This assignment develops a two approximation algorithms for the Knapsack problem, defined as follows. There is a set of n items and knapsack that can hold a maximum weight of W ....

Consider the Knapsack problem. Let I be the set of items, a, b, be the size and the profit of item i for any i I, and W be the knapsack size. Consider the following greedy algorithm: 1. Sort the...

Predictive text entry systems are familiar on touch screens and mobile phones. This question asks you to consider how the same principles might be used in a programming editor for creating Java code....

In a Hopfield neural network configured as an associative memory, with all of its weights trained and fixed, what three possible behaviours may occur over time in configuration space as the net...

Let A, B be sets. Define: (a) the Cartesian product (A B) (b) the set of relations R between A and B (c) the identity relation A on the set A [3 marks] Suppose S, T are relations between A and B, and...

a greedy algorithm is proposed for the given problem. Give a simple counterexample for each of them to show that the proposed greedy algorithm does not always return the optimal solution (this is...

The following percentages apply to Lowther Company for 2011 and 2012. Required Assuming that sales were $500,000 in 2011 and $600,000 in 2012, prepare income statements for the two years. 2012 2011...

The relationship between the areas in the current and reference configurations is described by O Nanson's formula Transformation Law O Cauchy theorem Deformation Gradient Tensor Transformation Tensor

Your development machine has many Docker images, but some are no longer used for active projects. To free up disk space, which command would help you clean up unused Docker images? 1 point Use docker...

Seved Help 14 Wisconsin Snowmobile Corp. is considering a switch to level production Cost efficiencies would occur under level production, and aftertax costs would decline by $31,500, but inventory...

What would be the shared Data Elements between Position Control and Salary Grade Tables in providing cost input to Budgets for vacant positions?

What is the purpose of the Salary Structure Table?

What is the scope and use of a Job Family Table?