Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

@article{Goemans1995ImprovedAA,
  title={Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming},
  author={M. Goemans and David P. Williamson},
  journal={J. ACM},
  year={1995},
  volume={42},
  pages={1115-1145}
}
  • M. Goemans, David P. Williamson
  • Published 1995
  • Mathematics, Computer Science
  • J. ACM
  • We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least.87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution to a nonlinear programming relaxation. This relaxation can be interpreted both as a semidefinite program and as an eigenvalue minimization problem. The best previously known approximation algorithms… CONTINUE READING
    3,256 Citations
    Semidefinite Programming Based Algorithms for the Sparsest Cut Problem
    • PDF
    Sums of squares based approximation algorithms for MAX-SAT
    • 9
    Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
    • 36
    Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
    • 23
    • Highly Influenced
    Solving the max-cut problem using semidefinite optimization
    • Derkaoui Orkia, A. Lehireche
    • Computer Science
    • 2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)
    • 2016
    • PDF
    Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs
    • 7
    • PDF
    Parallel Approximation Algorithms by Positive Linear Programming
    • L. Trevisan
    • Computer Science, Mathematics
    • Algorithmica
    • 1998
    • 75
    • Highly Influenced
    • PDF
    Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
    • 218
    • PDF
    Approximating np-hard problems efficient algorithms and their limits
    • 45
    • Highly Influenced
    • PDF
    Improved approximation of Max-Cut on graphs of bounded degree
    • 57
    • PDF

    References

    SHOWING 1-2 OF 2 REFERENCES
    Geomety 11
    • Springer-Verlag, Berlin.
    • 1987
    Interior point methods for max-min
    • 1993