Min CSP on four elements: Moving beyond submodularity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6876 LNCS, Issue , 2011, Pages 438-453

  Jonsson, Peter ^a   Kuivinen, Fredrik ^b   Thapper, Johan ^b  

^a LINKÖPING UNIVERSITY   (Sweden)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

bisubmodularity; combinatorial optimisation; computational complexity; Constraint satisfaction problems; submodularity

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; COMPUTER AIDED ANALYSIS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; COST FUNCTIONS; GRAPHIC METHODS; HARDNESS; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

BISUBMODULARITY; COMPUTER ASSISTED; GRAPH-BASED TECHNIQUES; POLYNOMIAL-TIME; REDUCTION TECHNIQUES; SUBMODULARITY; UNIQUE GAMES CONJECTURE; VALUED CONSTRAINT SATISFACTION PROBLEMS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 80053009362     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23786-7_34     Document Type: Conference Paper

References (17)

1. Cohen, D., Cooper, M., Jeavons, P.: An algebraic characterisation of complexity for valued constraint. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 107-121. Springer, Heidelberg (2006)
2. Cohen, D., Cooper, M., Jeavons, P., Krokhin, A.: The complexity of soft constraint satisfaction. Artif. Intell. 170(11), 983-1016 (2006)
3. Cohen, D., Creed, P., Jeavons, P., Živný, S.: An algebraic theory of complexity for valued constraints: Establishing a Galois connection. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 231-242. Springer, Heidelberg (to appear, 2011)
4. Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.): Complexity of Constraints. LNCS, vol. 5250. Springer, Heidelberg (2008)
5. Deineko, V., Jonsson, P., Klasson, M., Krokhin, A.: The approximability of MAX CSP with fixed-value constraints. J. ACM 55(4), 1-37 (2008)
6. Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48(4), 761-777 (2001)
7. Jeavons, P., Cohen, D., Gyssens, M.: How to determine the expressive power of constraints. Constraints 4(2), 113-131 (1999)
8. Jonsson, P., Klasson, M., Krokhin, A.: The approximability of three-valued MAX CSP. SIAM J. Comput. 35(6), 1329-1349 (2006)
9. Kolmogorov, V., Živný, S.: The complexity of conservative finite-valued CSPs. CoRR, abs/1008.1555 (2010)
10. Krokhin, A., Larose, B.: Maximizing supermodular functions on product lattices, with application to maximum constraint satisfaction. SIAM J. Discrete Math. 22(1), 312-328 (2008)
11. Kuivinen, F.: Algorithms and Hardness Results for Some Valued CSPs. PhD thesis, Linköping University (2009)
12. McCormick, S.T., Fujishige, S.: Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. Math. Program. 122(1), 87-120 (2010)
13. Queyranne, M., Spieksma, F., Tardella, F.: A general class of greedily solvable linear programs. Math. Oper. Res. 23(4), 892-908 (1998)
14. Raghavendra, P.: Optimal algorithms and inapproximability results for every CSP? In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC 2008), pp. 245-254 (2008)
15. Schrijver, A.: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Comb. Theory, Ser. B 80(2), 346-355 (2000)
16. Takhanov, R.: A dichotomy theorem for the general minimum cost homomorphism problem. In: Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), pp. 657-668 (2010)
17. Živný, S.: The Complexity and Expressive Power of Valued Constraints. PhD thesis, Oxford University Computing Laboratory (2009)