Near-optimal approximation algorithm for simultaneous M ax -C ut
symposium on discrete algorithms, pp. 1407-1425, 2018.
In the simultaneous M ax -C ut problem, we are given k weighted graphs on the same set of n vertices, and the goal is to find a cut of the vertex set so that the minimum, over the k graphs, of the cut value is as large as possible. Previous work [BKS15] gave a polynomial time algorithm which achieved an approximation factor of 1/2 ...More
Full Text (Upload PDF)
PPT (Upload PPT)