please answer me appropraitly blem 2. Given a directed graph G (V, E), pick a ma

Question

please answer me appropraitly blem 2. Given a directed graph G (V, E), 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. So, the right graph is acyclic. Give a factor ½ approximation algorithm for this problem. Pro Hint: Arbitrarily number of the vertices and pick the bigger of the two sets, the forward-going and the back-going edges. Give and prove the computational time and approximation ratio. 04

Explanation / Answer

computational time is O(m+n)

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.