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
An algorithm with approximation ratio k is called a ... View full answer
Get step-by-step solutions from verified subject matter experts
