Approximation Algorithm for the Max-cut Problem

  title={Approximation Algorithm for the Max-cut Problem},
  author={Wilsin Gosti and Giao Nguyen and Marlene Wan and Min Zhou},
In this project, we investigated several approximation algorithms for the Max-Cut problem. Our main approach to this problem is a semideenite program (GW) based algorithm that has a performance guarantee of at least 0.878 of the optimal cut. We also show that we can perform exhaustive local search on top of the GW to enhance the result. Our results show… CONTINUE READING