An Efficient Approximation Algorithm for Max-Cut

Free registration required

Executive Summary

The paper will work on solving the NP-hard problem, namely the MAX-CUT problem. Good approximation algorithms are known in the literature for this problem. The objective is to adopt an existing approximation algorithm for Max-Cut for a variant of this problem. Significant research effort has been devoted in the study of approximation algorithms for NP-hard problems. Approximation algorithm for Max-Cut problem with performance guarantee of 0.87856 is long known. In this paper, the authors study balanced Max-Cut problem

  • Format: PDF
  • Size: 919.98 KB