Semidefinite programming and approximation algorithms: A survey

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations


Computing approximate solutions for NP-hard problems is an important research endeavor. Since the work of Goemans-Williamson in 1993, semidefinite programming (a form of convex programming in which the variables are vector inner products) has been used to design the current best approximation algorithms for problems such as MAX-CUT, MAX-3SAT, SPARSEST CUT, GRAPH COLORING, etc. The talk will survey this area, as well as its fascinating connections with topics such as geometric embeddings of metric spaces, and Khot's unique games conjecture. The talk will be self-contained.

Original languageEnglish (US)
Title of host publicationAlgorithms and Computation - 22nd International Symposium, ISAAC 2011, Proceedings
Number of pages4
StatePublished - 2011
Event22nd International Symposium on Algorithms and Computation, ISAAC 2011 - Yokohama, Japan
Duration: Dec 5 2011Dec 8 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7074 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other22nd International Symposium on Algorithms and Computation, ISAAC 2011

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Semidefinite programming and approximation algorithms: A survey'. Together they form a unique fingerprint.

Cite this