How good is the Goemans-Williamson MAX CUT algorithm?

Authors:
Howard Karloff
Affiliations:
College of Computing, Georgia Institute of Technology, Atlanta, GA
Venue:
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Year:
1996

Citing 2
Cited 8

On the cut polytope

Mathematical Programming: Series A and B
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)

Open problems: 16

ACM SIGACT News
Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation of max-cut on graphs of bounded degree

Journal of Algorithms
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs

ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Mining newsgroups using networks arising from social behavior

WWW '03 Proceedings of the 12th international conference on World Wide Web
Bipartite Subgraphs and the Smallest Eigenvalue

Combinatorics, Probability and Computing
Linear programming relaxations of maxcut

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract