Semidefinite programming and approximation algorithms: A survey

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

Volumn 7074 LNCS, Issue , 2011, Pages 6-9

  Arora, Sanjeev ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE SOLUTION; CONVEX PROGRAMMING; EMBEDDINGS; GRAPH COLORINGS; INNER PRODUCT; MAX-CUT; METRIC SPACES; SEMI-DEFINITE PROGRAMMING; SPARSEST CUT; UNIQUE GAMES CONJECTURE;

COMPUTATIONAL COMPLEXITY; MATHEMATICAL PROGRAMMING; SURVEYS; VECTOR SPACES;

APPROXIMATION ALGORITHMS;

EID: 84055193946     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25591-5_2     Document Type: Conference Paper

References (17)

1. Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)
2. Arora, S., Lee, J.R., Naor, A.: Euclidean distortion and the sparsest cut. J. Amer. Math. Soc. 21(1), 1-21 (2008)
3. Arora, S., Lund, C.: Hardness of approximations. In: Approximation Algorithms for NP-hard Problems. Course Technology (1996)
4. Arora, S., Rao, S., Vazirani, U.V.: Expander flows, geometric embeddings and graph partitioning. J. ACM 56(2) (2009);
5. Prelim version ACM STOC 2004
6. Barak, B., Raghavendra, P., Steurer, D.: Rounding semidefinite programming hierarchies via global correlation. CoRR, abs/1104.4680 (2011);
7. To appear in IEEE FOCS 2011
8. Chawla, S., Gupta, A., Räcke, H.: Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. In: SODA 2005: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 102-111. Society for Industrial and Applied Mathematics, Philadelphia (2005)
9. Goemans, M.X.: Semidefinite programming and combinatorial optimization. In: Proceedings of the International Congress of Mathematicians, Berlin, vol. III, pp. 657-666 (1998)
10. Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach. 42(6), 1115-1145 (1995)
11. Harsha, P., Charikar, M., Andrews,M., Arora, S.,Khot, S.,Moshkovitz, D., Zhang, L., Aazami, A., Desai, D., Gorodezky, I., Jagannathan, G., Kulikov, A.S., Mir, D.J., Newman, A., Nikolov, A., Pritchard, D., Spencer, G.: Limits of approximation algorithms: Pcps and unique games (dimacs tutorial lecture notes). CoRR, abs/1002.3864 (2010)
12. Khot, S.: On the unique games conjecture (invited survey). In: Annual IEEE Conference on Computational Complexity, pp. 99-121 (2010)
13. Raghavendra, P., Steurer, D.: Integrality gaps for strong SDP relaxations of Unique Games. In: FOCS, pp. 575-585 (2009)
14. Shmoys, D.,Williamson, D.: Design of Approximation Algorithms. Cambridge University Press (2011)
15. Trevisan, L.: Inapproximability of combinatorial optimization problems. CoRR, cs.CC/0409043 (2004)
16. Trevisan, L.: Inapproximability of combinatorial optimization problems. CoRR, cs.CC/0409043 (2004)
17. Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)