In the MULTIWAY CUT problem, the input is an undirected graph G = (V, E) and a set of terminal nodes s1; s2,...,sk ∈ V. The goal is to find the minimum set of edges in E whose removal leaves all terminals in different components.
(a) Show that this problem can be solved exactly in polynomial time when k = 2.
(b) Give an approximation algorithm with ratio at most 2 for the case k = 3.
(c) Design a local search algorithm for multiway cut.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.