Question: Given a directed graph G = (V, R), pick a maximum cardinality set of edges from E so that the result graph is acyclic. The

Given a directed graph G = (V, R), pick a maximum cardinality set of edges from E so that the result graph is acyclic. The left graph below has a directed cycle, but the right graph does not have any directed cycle, but the right graph does not have any directed cycle. So the right graph is acyclic. Give a factor 1/2 approximation algorithm for this
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
