Towards an $O(\sqrt[3]{\log n})$-Approximation Algorithm for {\sc Balanced Separator}

Manjish Pal

The {\sc $c$-Balanced Separator} problem is a graph-partitioning problem in which given a graph $G$, one aims to find a cut of minimum size such that both the sides of the cut have…