Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION

@inproceedings{Frieze1995ImprovedAA,
  title={Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION},
  author={Alan M. Frieze and Mark Jerrum},
  booktitle={IPCO},
  year={1995}
}
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. 
Highly Influential
This paper has highly influenced 57 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 238 extracted citations

An Approximability-related Parameter on Graphs - Properties and Applications

Discrete Mathematics & Theoretical Computer Science • 2015
View 9 Excerpts
Highly Influenced

An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem

INFORMS Journal on Computing • 2014
View 13 Excerpts
Highly Influenced

A Local Search Approximation Algorithm for Max-k-Cut of Graph and Hypergraph

2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming • 2011
View 5 Excerpts
Highly Influenced

Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?

45th Annual IEEE Symposium on Foundations of Computer Science • 2004
View 13 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Titchmarsh, The Theory of Functions (second edition)

E C.
Oxford Uni- versity Press, • 1939
View 4 Excerpts
Highly Influenced

Complexity: Knots, Colourings and Counting, London Math- ematical Society Lecture Notes 186

D.J.A. Welsh
1993
View 3 Excerpts
Highly Influenced

Heuristic analysis, linear programming and branch and bound, Mathematical Programming Study 13: Combinatorial Optimiza

L. A. Wolsey
1980
View 3 Excerpts
Highly Influenced

Order Statistics, Wiley

H. A. David
New York, • 1980

The Asymptotic Theory of Extreme Order Statistics, Wiley

J. Galambos
1978

Orthogonal Functions, (translated from the Italian by A

G. Sansone
H. Dia- mond), • 1959
View 1 Excerpt

Notes on generating functions of polynomials: Hermite poly- nomials

G. N. Watson
Journal of the London Mathematical Society • 1933
View 1 Excerpt

Similar Papers

Loading similar papers…