CITATION STYLE
Gärtner, B., & Matoušek, J. (2012). Constraint Satisfaction Problems, and Relaxing Them Semidefinitely. In Approximation Algorithms and Semidefinite Programming (pp. 193–210). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-22015-9_12
Mendeley helps you to discover research relevant for your work.