.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A new way to use semidefinite programming with applications to linear equations mod p
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION
Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
Gadgets Approximation, and Linear Programming
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Is constraint satisfaction over two variables always easy?
Random Structures & Algorithms
Solving Generalized Maximum Dispersion with Linear Programming
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Conflict Resolution in the Scheduling of Television Commercials
Operations Research
| Hi-index | 0.00 |
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.