This objective function favors solutions that are both sparse (few edges crossing the cut) and balanced (close to a bisection), and the best known algorithm is an O (\\ sqrt) approximation due to.
This objective function favors solutions that are both sparse (few edges crossing the cut) and balanced (close to a bisection). The problem is known to be NP-Hard, and the best known algorithm is an O (\\ sqrt) approximation due to.