Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)
Arora, S., Lee, J.R., Naor, A.: Euclidean distortion and the sparsest cut. J. Amer. Math. Soc. 21(1), 1–21 (2008)
Arora, S., Lund, C.: Hardness of approximations. In: Approximation Algorithms for NP-hard Problems. Course Technology (1996)
Arora, S., Rao, S., Vazirani, U.V.: Expander flows, geometric embeddings and graph partitioning. J. ACM 56(2) (2009); Prelim version ACM STOC 2004
Barak, B., Raghavendra, P., Steurer, D.: Rounding semidefinite programming hierarchies via global correlation. CoRR, abs/1104.4680 (2011); To appear in IEEE FOCS 2011
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)
Goemans, M.X.: Semidefinite programming and combinatorial optimization. In: Proceedings of the International Congress of Mathematicians, Berlin, vol. III, pp. 657–666 (1998)
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)
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)
Khot, S.: On the unique games conjecture (invited survey). In: Annual IEEE Conference on Computational Complexity, pp. 99–121 (2010)
Raghavendra, P., Steurer, D.: Integrality gaps for strong SDP relaxations of Unique Games. In: FOCS, pp. 575–585 (2009)
Shmoys, D., Williamson, D.: Design of Approximation Algorithms. Cambridge University Press (2011)
Trevisan, L.: Inapproximability of combinatorial optimization problems. CoRR, cs.CC/0409043 (2004)
Trevisan, L.: Inapproximability of combinatorial optimization problems. CoRR, cs.CC/0409043 (2004)
Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arora, S. (2011). Semidefinite Programming and Approximation Algorithms: A Survey. In: Asano, T., Nakano, Si., Okamoto, Y., Watanabe, O. (eds) Algorithms and Computation. ISAAC 2011. Lecture Notes in Computer Science, vol 7074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25591-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-25591-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25590-8
Online ISBN: 978-3-642-25591-5
eBook Packages: Computer ScienceComputer Science (R0)