Question: Problem 2: Max Directed Cut I In the maximum directed cut problem (sometimes called MAX DICUT), we are given as input a directed graph G

Problem 2: Max Directed Cut I In the maximum directed cut problem (sometimes called MAX DICUT), we are given as input a directed graph G - (V, A). Each directed arc (i,j) A has nonnegative weight wij 2 0. The goal is to partition V into two sets U and W-V- U so as to maximize the total weight of the arcs going from U to W (that is, arcs (i,j) with i ? U andje W). Give a randomized -approximation algorithm for this problem. No LPs allowed. Problem 2: Max Directed Cut I In the maximum directed cut problem (sometimes called MAX DICUT), we are given as input a directed graph G - (V, A). Each directed arc (i,j) A has nonnegative weight wij 2 0. The goal is to partition V into two sets U and W-V- U so as to maximize the total weight of the arcs going from U to W (that is, arcs (i,j) with i ? U andje W). Give a randomized -approximation algorithm for this problem. No LPs allowed
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
