L. Barto, The collapse of the bounded width hierarchy, Journal of Logic and Computation, vol.61, issue.3, 2014.
DOI : 10.4153/CJM-2009-023-2

L. Barto and M. Kozik, Robust satisfiability of constraint satisfaction problems, Proceedings of the 44th symposium on Theory of Computing, STOC '12, pp.931-940, 2012.
DOI : 10.1145/2213977.2214061

L. Barto and M. Kozik, Constraint Satisfaction Problems Solvable by Local Consistency Methods, Journal of the ACM, vol.61, issue.1, 2014.
DOI : 10.1142/S021819670900524X

A. Bulatov, Combinatorial problems raised from 2-semilattices, Journal of Algebra, vol.298, issue.2, pp.321-339, 2006.
DOI : 10.1016/j.jalgebra.2004.07.044
URL : https://doi.org/10.1016/j.jalgebra.2004.07.044

A. Bulatov, A. Krokhin, and P. Jeavons, Classifying the Complexity of Constraints Using Finite Algebras, SIAM Journal on Computing, vol.34, issue.3, pp.720-742, 2005.
DOI : 10.1137/S0097539700376676

C. Chekuri, S. Khanna, J. Naor, and L. Zosin, A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem, SIAM Journal on Discrete Mathematics, vol.18, issue.3, pp.608-625, 2004.
DOI : 10.1137/S0895480101396937

D. A. Cohen, M. C. Cooper, and P. G. Jeavons, Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms, Theoretical Computer Science, vol.401, issue.1-3, pp.1-336, 2008.
DOI : 10.1016/j.tcs.2008.03.015

D. A. Cohen, M. C. Cooper, P. G. Jeavons, and A. A. Krokhin, The complexity of soft constraint satisfaction, Artificial Intelligence, vol.170, issue.11, pp.983-1016, 2006.
DOI : 10.1016/j.artint.2006.04.002

V. Dalmau, A. Krokhin, and R. Manokaran, Towards a Characterization of Constant-Factor Approximable Min CSPs, Proc. SODA'15, 2015.
DOI : 10.1137/1.9781611973730.58

V. Dalmau and A. A. Krokhin, Robust Satisfiability for CSPs, ACM Transactions on Computation Theory, vol.5, issue.4
DOI : 10.1145/2540090

W. Fernandez-de, L. Vega, and C. Kenyon-mathieu, Linear programming relaxations of maxcut, Proc. SODA'07, pp.53-61, 2007.

A. Ene, J. Vondrák, and Y. Wu, Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems, SODA'13, pp.306-325, 2013.
DOI : 10.1137/1.9781611973105.23

T. Feder and M. Y. Vardi, The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory, SIAM Journal on Computing, vol.28, issue.1, pp.57-104, 1998.
DOI : 10.1137/S0097539794266766

P. Fulla and S. , A Galois Connection for Valued Constraint Languages of Infinite Size, Proc. ICALP'15, 2015.
DOI : 10.1007/978-3-662-47672-7_42

A. Huber, A. Krokhin, and R. Powell, Skew Bisubmodularity and Valued CSPs, SIAM Journal on Computing, vol.43, issue.3, pp.1064-1084, 2014.
DOI : 10.1137/120893549

P. Jeavons, A. Krokhin, and S. , The complexity of valued constraint satisfaction, Bulletin of the EATCS, vol.113, pp.21-55, 2014.

V. Kolmogorov, J. Thapper, and S. , The Power of Linear Programming for General-Valued CSPs, SIAM Journal on Computing, vol.44, issue.1, pp.1-36, 2015.
DOI : 10.1137/130945648
URL : https://hal.archives-ouvertes.fr/hal-01762346

V. Kolmogorov and S. , The complexity of conservative valued CSPs, Journal of the ACM, vol.60, issue.2, p.2013
DOI : 10.1145/2450142.2450146

M. Kozik, A. Krokhin, M. Valeriote, and R. Willard, Characterizations of several Maltsev conditions, Algebra universalis, vol.64, issue.77, 2014.
DOI : 10.1007/s00012-010-0082-3

G. Kun, R. O. Donnell, S. Tamaki, Y. Yoshida, and Y. Zhou, Linear programming, width-1 CSPs, and robust satisfaction, Proceedings of the 3rd Innovations in Theoretical Computer Science Conference on, ITCS '12, pp.484-495
DOI : 10.1145/2090236.2090274

B. Larose and L. Zádori, Bounded width problems and algebras, Algebra universalis, vol.56, issue.3-4, pp.439-466, 2007.
DOI : 10.1007/s00012-007-2012-6

M. Kozik and J. Ochremiak, Algebraic Properties of Valued Constraint Satisfaction Problem, Proc. ICALP'15, 2015.
DOI : 10.1007/978-3-662-47672-7_69

P. Raghavendra, Optimal algorithms and inapproximability results for every CSP?, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, pp.245-254, 2008.
DOI : 10.1145/1374376.1374414
URL : http://www.cs.washington.edu/homes/prasad/Files/extabstract.pdf

H. D. Sherali and W. P. Adams, A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems, SIAM Journal on Discrete Mathematics, vol.3, issue.3, pp.411-430, 1990.
DOI : 10.1137/0403036

R. Takhanov, A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem, Proc. STACS'10, pp.657-668, 2010.

J. Thapper and S. , The Power of Linear Programming for Valued CSPs, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp.669-678, 2012.
DOI : 10.1109/FOCS.2012.25
URL : https://hal.archives-ouvertes.fr/hal-01762346

J. Thapper and S. , The complexity of finite-valued CSPs, Proc. STOC'13, pp.695-704, 2013.

J. Thapper and S. , Necessary Conditions on Tractability of Valued Constraint Languages, 2015.

H. Uppman, The Complexity of Three-Element Min-Sol and Conservative Min-Cost-Hom, Proc. ICALP'13, pp.804-815, 2013.
DOI : 10.1007/978-3-642-39206-1_68

Y. Yoshida and Y. Zhou, Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems, Proceedings of the 5th conference on Innovations in theoretical computer science, ITCS '14, pp.423-438, 2014.
DOI : 10.1145/2554797.2554836