A Parameterized Approximation Scheme for Min $k$-Cut

Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan

In the Min $k$-Cut problem, input is an edge weighted graph $G$ and an integer $k$, and the task is to partition the vertex set into $k$ non-empty sets, such that the total weight…