论文信息 - Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION

Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION

Polynomial-time approximation algorithms with non-trivial performance guarantees are presented for the problems of (a) partitioning the vertices of a weighted graph into k blocks so as to maximise the weight of crossing edges, and (b) partitioning the vertices of a weighted graph into two blocks of equal cardinality, again so as to maximise the weight of crossing edges. The approach, pioneered by Goemans and Williamson, is via a semidefinite programming relaxation.

Alan M. Frieze | Mark Jerrum | A. Frieze | M. Jerrum

[1] G. N. Watson,et al. Notes on Generating Functions of Polynomials: (2) Hermite Polynomials , 1933 .

[2] E. Bofinger,et al. THE CORRELATION OF MAXIMA IN SAMPLES DRAWN FROM A BIVARIATE NORMAL DISTRIBUTION1 , 1965 .

[3] J. D. T. Oliveira,et al. The Asymptotic Theory of Extreme Order Statistics , 1979 .

[4] L. Wolsey. Heuristic analysis, linear programming and branch and bound , 1980 .

[5] M. Dwass. The Asymptotic Theory of Extreme Order Statistics (Janos Galambos) , 1980 .

[6] J. Angus. The Asymptotic Theory of Extreme Order Statistics , 1990 .

[7] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.

[8] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[9] D. Welsh. Complexity: Knots, Colourings and Counting: Link polynomials and the Tait conjectures , 1993 .

[10] David P. Williamson,et al. .879-approximation algorithms for MAX CUT and MAX 2SAT , 1994, STOC '94.

[11] Marek Karpinski,et al. Polynomial time approximation schemes for dense instances of NP-hard problems , 1995, STOC '95.

[12] Sanjeev Khanna,et al. On the Hardness of Approximating Max k-Cut and its Dual , 1997, Chic. J. Theor. Comput. Sci..

[13] Christopher J. BISHOPAbstra,et al. Orthogonal Functions , 2022 .