Question: Give an example of a graph G with at least 10 vertices such that the greedy 2- approximation algorithm for VERTEX-COVER given above is guaranteed

Give an example of a graph G with at least 10 vertices such that the greedy 2- approximation algorithm for VERTEX-COVER given above is guaranteed to produce a suboptimal vertex cover.

Step by Step Solution

3.49 Rating (162 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

An algorithm with approximation ratio k is called a ... View full answer

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 Data Structures Algorithms Questions!