Advertisement

Semidefinite Programming

  • Vijay V. Vazirani

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  1. 112.
    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.MathSciNetCrossRefGoogle Scholar
  2. 207.
    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.CrossRefGoogle Scholar
  3. 168.
    H. Karloff. How good is the Goemans-Williamson MAX CUT algorithm. SIAM Journal on Computing, 29: 336–350, 1999.MathSciNetCrossRefGoogle Scholar
  4. 90.
    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.Google Scholar
  5. 5.
    F. Alizadeh. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM Journal on Optimization, 5: 13–51, 1995.MathSciNetCrossRefGoogle Scholar
  6. 222.
    Y. Nesterov and A. Nemirovskii. Interior Point Polynomial Methods in Convex Programming. SIAM, Philadelphia, PA, 1994.Google Scholar
  7. 223.
    M.L. Overton. On minimizing the maximum eigenvalue of a symmetric matrix. SIAM J. on Matrix Analysis and Appl., 13: 256–268, 1992.MathSciNetCrossRefGoogle Scholar
  8. 268.
    H. Wolkowitz. Some applications of optimization in matrix theory. Linear Algebra and its Applications, 40: 101–118, 1981.MathSciNetCrossRefGoogle Scholar
  9. 258.
    L. Vandenberghe and S. Boyd. Semidefinite programming. SIAM Review, 38: 49–95, 1996.MathSciNetCrossRefGoogle Scholar
  10. 203.
    L. Lovâsz and A. Schrijver. Cones of matrices and set functions, and 0–1 optimization. SIAM Journal on Optimization, 1: 166–190, 1990.MathSciNetCrossRefGoogle Scholar
  11. 87.
    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.CrossRefGoogle Scholar
  12. 96.
    A. Frieze and M. Jerrum. Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Algorithmica, 18: 67–81, 1997.MathSciNetCrossRefGoogle Scholar
  13. 165.
    D. Karger, R. Motwani, and M. Sudan. Approximate graph coloring by semidefinite programming. Journal of the ACM, 45: 246–265, 1998.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Vijay V. Vazirani
    • 1
  1. 1.Georgia Institute of TechnologyCollege of ComputingAtlantaUSA

Personalised recommendations