A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Bilu-Linial Stable Instances of Max Cut and Minimum Multiway Cut
[article]
2013
arXiv
pre-print
We investigate the notion of stability proposed by Bilu and Linial. We obtain an exact polynomial-time algorithm for γ-stable Max Cut instances with γ≥ c√( n) n for some absolute constant c > 0. Our algorithm is robust: it never returns an incorrect answer; if the instance is γ-stable, it finds the maximum cut, otherwise, it either finds the maximum cut or certifies that the instance is not γ-stable. We prove that there is no robust polynomial-time algorithm for γ-stable instances of Max Cut
arXiv:1305.1681v3
fatcat:uqj7a2il35egjjjnwtcflpdggq