International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 63 - Number 8 |
Year of Publication: 2013 |
Authors: Abdullah Al-malaise Al-ghamdi, Pawan Kumar Patel, Kunal Gupta |
10.5120/10484-5234 |
Abdullah Al-malaise Al-ghamdi, Pawan Kumar Patel, Kunal Gupta . An Efficient Approximation Algorithm for Max-Cut. International Journal of Computer Applications. 63, 8 ( February 2013), 5-9. DOI=10.5120/10484-5234
Significant research effort has been devoted in the study of approximation algorithms for NP-hard problems. Ap-proximation algorithm for Max-Cut problem with performance guarantee of 0. 87856 is long known. In this work we study balanced Max-Cut problem. We give a balancing factor ? for given ? such that the approximate solution is at least 0. 87856 times the optimal ?-balanced cut and it is itself ?-balanced.