Semidefinite Programming and Approximation Algorithms: A Survey
暂无分享,去创建一个
[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.