论文信息 - An Efficient Approximation Algorithm for Max-Cut

An Efficient Approximation Algorithm for Max-Cut

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.

[1] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[2] Hantao Zhang,et al. Improving exact algorithms for MAX-2-SAT , 2005, Annals of Mathematics and Artificial Intelligence.

[3] Hantao Zhang,et al. Study of Lower Bound Functions for MAX-2-SAT , 2004, AAAI.

[4] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[5] Rolf Niedermeier,et al. New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT , 2000, Electron. Colloquium Comput. Complex..

[6] Rolf Niedermeier,et al. Faster exact algorithms for hard problems: A parameterized point of view , 2001, Discret. Math..

[7] Teofilo F. Gonzalez,et al. P-Complete Approximation Problems , 1976, J. ACM.