论文信息 - An Approximation Algorithm for Max p-Section

An Approximation Algorithm for Max p-Section

We present an approximation algorithm for the problem of partitioning the vertices of a weighted graph into p blocks of equal size so as to maximize the weight of the edges connecting different blocks. The algorithm is based on semidefinite programming and can in some sense be viewed as a generalization of the approximation algorithm by Frieze and Jerrum for the MAX BISECTION problem. Our algorithm, as opposed to that of Frieze and Jerrum, gives better performance than the naive randomized algorithm also for p > 2.

Gunnar Andersson | G. Andersson

[1] Luca Trevisan,et al. Gadgets, approximation, and linear programming , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[2] Johan Håstad,et al. A new way to use semidefinite programming with applications to linear equations mod p , 2001, SODA '99.

[3] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[4] Alan M. Frieze,et al. Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION , 1995, IPCO.

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

[6] Uri Zwick,et al. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint , 1998, SODA '98.

[7] Johan Håstad,et al. Some optimal inapproximability results , 1997, STOC '97.