Abstract
In the previous chapters of Part II of this book we have shown how linear programs provide a systematic way of placing a good lower bound on OPT (assuming a minimization problem), for numerous NP-hard problems. As stated earlier, this is a key step in the design of an approximation algorithm for an NP-hard problem. It is natural, then, to ask if there are other widely applicable ways of doing this.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Notes
M.X. Goemans and D.P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42: 1115–1145, 1995.
S. Mahajan and H. Ramesh. Derandomizing semidefinite programming based approximation algoirthms. In Proc. 36th IEEE Annual Symposium on Foundations of Computer Science, pages 162–169, 1995.
H. Karloff. How good is the Goemans-Williamson MAX CUT algorithm. SIAM Journal on Computing, 29: 336–350, 1999.
U. Feige and G. Schechtman. On the optimality of the random hyperplane rounding technique for MAX-CUT. In Proc. 33rd ACM Symposium on the Theory of Computing, 2001.
F. Alizadeh. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM Journal on Optimization, 5: 13–51, 1995.
Y. Nesterov and A. Nemirovskii. Interior Point Polynomial Methods in Convex Programming. SIAM, Philadelphia, PA, 1994.
M.L. Overton. On minimizing the maximum eigenvalue of a symmetric matrix. SIAM J. on Matrix Analysis and Appl., 13: 256–268, 1992.
H. Wolkowitz. Some applications of optimization in matrix theory. Linear Algebra and its Applications, 40: 101–118, 1981.
L. Vandenberghe and S. Boyd. Semidefinite programming. SIAM Review, 38: 49–95, 1996.
L. Lovâsz and A. Schrijver. Cones of matrices and set functions, and 0–1 optimization. SIAM Journal on Optimization, 1: 166–190, 1990.
U. Feige and M.X. Goemans. Approximating the value of two prover proof systems, with applications to MAX-CUT and MAX DICUT. In Proc. 3rd Israel Symposium on Theory of Computing and Systems, pages 182–189, 1995.
A. Frieze and M. Jerrum. Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Algorithmica, 18: 67–81, 1997.
D. Karger, R. Motwani, and M. Sudan. Approximate graph coloring by semidefinite programming. Journal of the ACM, 45: 246–265, 1998.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Vazirani, V.V. (2003). Semidefinite Programming. In: Approximation Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04565-7_26
Download citation
DOI: https://doi.org/10.1007/978-3-662-04565-7_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08469-0
Online ISBN: 978-3-662-04565-7
eBook Packages: Springer Book Archive