TY - GEN

T1 - Semidefinite programming and approximation algorithms

T2 - 22nd International Symposium on Algorithms and Computation, ISAAC 2011

AU - Arora, Sanjeev

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84055193946&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84055193946&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-25591-5_2

DO - 10.1007/978-3-642-25591-5_2

M3 - Conference contribution

AN - SCOPUS:84055193946

SN - 9783642255908

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 6

EP - 9

BT - Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Proceedings

Y2 - 5 December 2011 through 8 December 2011

ER -