Semidefinite Programming and Approximation Algorithms: A Survey

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.

[1]  F. Rendl Semidefinite programming and combinatorial optimization , 1999 .

[2]  Prasad Raghavendra,et al.  Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[3]  David P. Williamson,et al.  The Design of Approximation Algorithms , 2011 .

[4]  M. Goemans Semidefinite programming and combinatorial optimization , 1998 .

[5]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[6]  Subhash Khot On the Unique Games Conjecture (Invited Survey) , 2010, Computational Complexity Conference.

[7]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[8]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[9]  Anupam Gupta,et al.  Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut , 2005, SODA '05.

[10]  Aleksandar Nikolov,et al.  Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) , 2010, ArXiv.

[11]  Luca Trevisan,et al.  Inapproximability of Combinatorial Optimization Problems , 2004, Electron. Colloquium Comput. Complex..

[12]  Prasad Raghavendra,et al.  Rounding Semidefinite Programming Hierarchies via Global Correlation , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[13]  Sanjeev Arora,et al.  Euclidean distortion and the sparsest cut , 2005, Symposium on the Theory of Computing.