Semidefinite programming and approximation algorithms: a survey

DOI10.1007/978-3-642-25591-5_2MaRDI QIDQ3104593zbMATH OpenOpenAlexFDO

Authors Sanjeev Arora

Publication date 16 December 2011

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25591-5_2

Mathematics Subject Classification ID

Approximation algorithms (68W25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Semidefinite programming (90C22) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 2081093
• Approximation algorithms and semidefinite programming.
• A gentle introduction to semi-definite programming
• scientific article; zbMATH DE number 1256751
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Cited in

(6)

• Constructing worst case instances for semidefinite programming based approximation algorithms
• Approximation algorithms and semidefinite programming.
• scientific article; zbMATH DE number 1305390 (Why is no real title available?)
• scientific article; zbMATH DE number 2081093 (Why is no real title available?)
• scientific article; zbMATH DE number 1489798 (Why is no real title available?)
• Basc: constrained approximation by semidefinite programming

This page was built for publication: Semidefinite programming and approximation algorithms: a survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104593)