We introduce and study $\ell_p$-norm-multiway-cut: the input here is an undirected graph with non-negative edge weights along with $k$ terminals and the goal is to find a partition of the vertex set into $k$ parts each containing exactly one terminal so as to minimize the $\ell_p$-norm of the cut values of the parts. This is a unified generalization of min-sum multiway cut (when $p=1$) and min-max multiway cut (when $p=\infty$), both of which are well-studied classic problems in the graph partitioning literature. We show that $\ell_p$-norm-multiway-cut is NP-hard for constant number of terminals and is NP-hard in planar graphs. On the algorithmic side, we design an $O(\log^2 n)$-approximation for all $p\ge 1$. We also show an integrality gap of $\Omega(k^{1-1/p})$ for a natural convex program and an $O(k^{1-1/p-\epsilon})$-inapproximability for any constant $\epsilon>0$ assuming the small set expansion hypothesis.

翻译：我们引入并研究$@ ell_ p$- norm- diut- oprout- cultive- current- cultive- cultive- cult- cultive- cultive: 这里输入的是一个没有方向的图表, 带有非负边边边重量, 加上美元, 以及 $k$ 终端, 目标是找到一个顶点在$k$ 中分离成每个完全包含一个终端的 $k$ 的部件, 以便最小化这些部件的削减值的 $_ p_ p$- norm- norm- norm。 在算法方面, 我们为所有 $p\ $= 1 和 min- mexmaxy 折叠加( $\ ksí1/ píp_ assimp} mailental sublicilal pro- subilation- pain_ sublon- sublical- sublical setal setal- pro_ pal- pal_ supplus_ pal- pal- pal- pro_ ro_ plus_ ro_ ro_ ro_ ro_ ro_ pal- pal- pal_ ro_ ro_ ro_ ro_ ro=_ ro=_ ro) ro_ ro_ ro_ ro_ ro) 任何 sucal- set- set- sucal- ps- ps- ps- ps- ro_ ro_____ ro_ ro_ sucal_ sucal_ sucal- sucal- sucal- sucal- sucal- sucal- sucal- sucal- sucal- sucal- sucal- set- set set ro- set sucal- set sucal- sucal- p_ sucal- sucal- set sucal- sucal-