Semidefinite Programming Based Approximation Algorithms

  • Uri Zwick
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2245)


The talk would describe the use of semidefinite programming in the development of approximation algorithms for combinatorial optimization problems. The talk would start with a definition of semidefinite programming. No prior knowledge of the subject would be assumed. It would then briefly cover Lovász’s ϑ-function, the MAX CUT approximation algorithm of Goemans and Williamson, the coloring algorithm of Karger, Motwani and Sudan, the MAX 3-SAT algorithm of Karloff and Zwick, and time permitting more modern developments.


Operating System Prior Knowledge Approximation Algorithm Mathematical Logic Combinatorial Optimization 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Uri Zwick
    • 1
  1. 1.School of Computer Science Tel Aviv UniversityTel AvivIsrael

Personalised recommendations