Question

#3. Suppose you have a minimization problem and an algorithm A, that has an approximation ratio of 4. When run on some input
0 0
Add a comment Improve this question Transcribed image text
Answer #1

Approximation ratio ρ(n) is the ratio of cost or result obtained by the algorithm and the optimal cost. For minimization problem it can be calculated using the equation  c/c* <= ρ(n).

Where, c = cost of the solution

c* = optimal cost of the solution.

Here in the given question c= 20, ρ(n)= 4 and we have to find the value of c*.

solving the equation,

  20/c* <= 4

this equation holds true for any value of c* >=5(refer to image for explanation) thus, OPT >=5 is the correct answer.

OPT>= 5: True, as explained above it satisfies the equation.

OPT< 5: False, equation does not satisfy for any value of c* less than 5.

OPT >80: True, any value greater than 80 will also be greater than 5 thus this condition satisfies the solution.

OPT <= 80: False, 2 is less than 80 but it does not satisfy c*>=5 and in OPT<=80 negative numbers will also come therefore this condition is false.

   

Please upvote if you like the answer and comment for any query.

Add a comment
Know the answer?
Add Answer to:
#3. Suppose you have a minimization problem and an algorithm A, that has an approximation ratio...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

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
  • Suppose you have a minimization problem and an algorithm A, that has an approximation ratio of...

    Suppose you have a minimization problem and an algorithm A, that has an approximation ratio of 4. When run on some input I, A produced a solution with cost 20. What can you say about the optimal answer (let's call it OPT)? Mark “true" or "false" for inequalities below and briefly explain your answer(s). • OP T5 • OP T < 5 • OP T >80 • OP T < 80

  • This is all I have 2. Consider the following approximation algorithm for the bin packing problem....

    This is all I have 2. Consider the following approximation algorithm for the bin packing problem. Algorithm Last Fit(1,S) Input: Set I of items and set S of item sizes; item I; E I has size S; Output: A packing of I into unit size bins B {} for each item I; e I do { if I; fits in one of the bins of B then Put I; in the last bin where it fits else { Add a...

  • The Problem A robot is asked to navigate a maze. It is placed at a certain...

    The Problem A robot is asked to navigate a maze. It is placed at a certain position (the starting position) in the maze and is asked to try to reach another position (the goal position). Positions in the maze will either be open or blocked with an obstacle. Positions are identified by (x,y) coordinates. At any given moment, the robot can only move 1 step in one of 4 directions. Valid moves are: ● Go North: (x,y) -> (x,y-1) ●...

  • 6. Linear Approximation a. Suppose you have a function f(x), and suppose you know df|3 =...

    6. Linear Approximation a. Suppose you have a function f(x), and suppose you know df|3 = −4 dx. What is the equation of the tangent line to y = f(x) at x = 3, if f(3) = 7? And give an estimate of f(2.8). b. The volume of a sphere of radius r is V = 1 3 πr3 . Find dV in terms of dr. Then find dV V in terms of dr r , and use it to...

  • Have the explaination please. 4 Graph Application: Network Connectivity (Adapted from Problem 9, Chapter 3 of...

    Have the explaination please. 4 Graph Application: Network Connectivity (Adapted from Problem 9, Chapter 3 of K&T) Think of a communications network as a connected, undi rected graph, where messages from one node s to another node t are sent along paths from s to t. Nodes can sometimes fail. If a node v fails then no messages can be sent along edges incident on v. A network is particularly vulnerable if failure of a single node v can cause...

  • 3. 0 marks Suppose you have an algorithm which has the following recurrence relation for W(n),...

    3. 0 marks Suppose you have an algorithm which has the following recurrence relation for W(n), assuming n is a power of 2, i.e. assuming n-2, k20: for n for n- W()-2W(n/2)+2n+ 2 W(n)- Using back substitution and assuming n is a power of 2, ie. n-2, find an exact (ie non-recursive) formula for Win). Be sure to show your work and to simplify your final answer as much as possible. Note that you do NOT need to verify your...

  • You are managing a large scale construction project with hundreds of subprojects, some which have to...

    You are managing a large scale construction project with hundreds of subprojects, some which have to be completed before others can begin whereas some subprojects can be carried out simultaneously. The project and its subprojects, and the presence of dependencies between subprojects (which subprojects have to be done before which), can be modeled as a connected unweighted directed graph with nodes representing subprojects and directed edges representing dependencies. 42. Which of the following algorithms will allow you to determine if...

  • Hi,. the question is below: Help if you can.. Here is some background information/ an example:...

    Hi,. the question is below: Help if you can.. Here is some background information/ an example: 9. Let k-Color be the following problem. Input: An undirected graph G. Question: Can the vertices of G be colored using k distinct colors, so that every pair of adjacent vertices are colored differently? Suppose that you were given a polynomial time algorithm for (k + 1)-Color. Use it to give a polynomial algorithm for k-Color. This means that you need to provide a...

  • Two words or phrases in English are anagrams if their letters (and only their letters), rearranged,...

    Two words or phrases in English are anagrams if their letters (and only their letters), rearranged, are the same. We assume that upper and lower case are indistinguishable, and punctuation and spaces don't count. Two phrases are anagrams if they contain exactly the same number of exactly the same letters, e.g., 3 A's, 0 B's, 2 C's, and so forth. Some examples and non-examples of regular anagrams: * The eyes / they see (yes) * moo / mo (no) *...

  • C++ PROGRAM ONLY! For this lab you need to write a program that will read in...

    C++ PROGRAM ONLY! For this lab you need to write a program that will read in two values from a user and output the greatest common divisor (using a recursive implementation of the Euclidean algorithm) to a file. In Lab #3, you implemented this program using an iterative method. Greatest Common Divisor In mathematics, the greatest common divisor (GCD) of two or more integers (when at least one of of them is zero then the larger value is the GCD....

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
ADVERTISEMENT