Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference40 articles.
1. Khanna, S., Sudan, M., Trevisan, L.: Constraint satisfaction: the approximability of minimization problems. In: Proceedings of Computational Complexity. Twelfth Annual IEEE Conference, pp. 282–296 (1997). https://doi.org/10.1109/CCC.1997.612323
2. Cooper, M.C.: Reduction operations in fuzzy or valued constraint satisfaction. Fuzzy Sets and Systems 134(3), 311–342 (2003). https://doi.org/10.1016/S0165-0114(02)00134-3
3. Cooper, M., de Givry, S., Sanchez, M., Schiex, T., Zytnicki, M.: Virtual arc consistency for weighted CSP. In: Twenty-third AAAI Conference on Artificial Intelligence. Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, p. 6. AAAI - Association for the Advancement of Artificial Intelligence, Chicago, United States (2008). https://hal.inrae.fr/hal-02752851
4. Hell, P., Nešetřil, J.: On the complexity of h-coloring. Journal of Combinatorial Theory, Series B 48(1), 92–110 (1990). https://doi.org/10.1016/0095-8956(90)90132-J
5. Jeavons, P.: On the algebraic structure of combinatorial problems. Theoretical Computer Science 200(1), 185–204 (1998). https://doi.org/10.1016/S0304-3975(97)00230-2