The power of linear programming for finite-valued CSPs: A constructive characterization

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

Volumn 7965 LNCS, Issue PART 1, 2013, Pages 625-636

  Kolmogorov, Vladimir ^a  

^a INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT LANGUAGE; FINITE DOMAINS; LINEAR PROGRAMMING RELAXATION; NP-HARD; POLYNOMIAL-TIME; SUFFICIENT CONDITIONS; VALUED CONSTRAINT SATISFACTION PROBLEMS;

AUTOMATA THEORY; CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT THEORY; COST FUNCTIONS; POLYNOMIAL APPROXIMATION;

LINEAR PROGRAMMING;

EID: 84880280046     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-39206-1_53     Document Type: Conference Paper

References (23)

1. Blake, A., Kohli, P., Rother, C. (eds.): Advances in Markov Random Fields for Vision and Image Processing. MIT Press (2011)
2. Cohen, D.A., Cooper, M.C., Jeavons, P.G.: An algebraic characterisation of complexity for valued constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 107-121. Springer, Heidelberg (2006) (Pubitemid 44618734)
3. Cohen, D., Cooper, M., Jeavons, P.: Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms. Theoretical Computer Science 401(1), 36-51 (2008)
4. Cohen, D., Cooper, M., Jeavons, P., Krokhin, A.: The complexity of soft constraint satisfaction. Artificial Intelligence 170(11), 983-1016 (2006)
5. Cooper, M.C., de Givry, S., Sanchez, M., Schiex, T., Zytnicki, M., Werner, T.: Soft arc consistency revisited. Artif. Intell. 174(7-8), 449-478 (2010)
6. Dalmau, V., Pearson, J.: Closure functions and width 1 problems. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 159-173. Springer, Heidelberg (1999)
7. Feder, T., Vardi, M.: The computational structure of monotone monadic SNP a and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing 28(1), 57-104 (1998)
8. Huber, A., Krokhin, A., Powell, R.: Skew bisubmodularity and valued CSPs. In: SODA (2013)
9. Khot, S.: On the unique games conjecture (invited survey). In: Proceedings of the 25th Annual IEEE Conference on Computational Complexity (CCC 2010), pp. 99-121 (2010)
10. Kolmogorov, V.: Convergent tree-reweighted messages passing. PAMI 28(10), 1568-1583 (2006)
11. Kolmogorov, V., Schoenemann, T.: Generalized sequential tree-reweighted message passing. CoRR, abs/1205.6352 (2012)
12. Kolmogorov, V.: The power of linear programming for valued CSPs: a constructive characterization. ArXiv, abs/1207.7213v4 (2012)
13. Kolmogorov, V., Živný, S.: The complexity of conservative valued CSPs. In: SODA (2012)
14. Koster, A., van Hoesel, C.P.M., Kolen, A.W.J.: The partial constraint satisfaction problem: Facets and lifting theorems. Operation Research Letters 23(3-5), 89-97 (1998)
15. Kun, G., O'Donnell, R., Tamaki, S., Yoshida, Y., Zhou, Y.: Linear programming, width-1 CSPs, and robust satisfaction. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS 2012, pp. 484-495 (2012)
16. Raghavendra, P.: Approximating NP-hard Problems: Efficient Algorithms and their Limits. PhD Thesis (2009)
17. Savchynskyy, B., Schmidt, S., Kappes, J.H., Schnörr, C.: Efficient MRF energy minimization via adaptive diminishing smoothing. In: UAI (2012)
18. Schlesinger, M.I.: Syntactic analysis of two-dimensional visual signals in noisy conditions. Kibernetika 4, 113-130 (1976) (in Russian)
19. Sontag, D., Globerson, A., Jaakkola, T.: Introduction to dual decomposition for inference. In: Sra, S., Nowozin, S., Wright, S.J. (eds.) Optimization for Machine Learning. MIT Press (2011)
20. Thapper, J., Živný, S.: The power of linear programming for valued CSPs. In: FOCS (2012)
21. Thapper, J., Živný, S.: The complexity of finite-valued CSPs. ArXiv, abs/1210.2987 (2012); To appear in STOC 2013
22. Wainwright, M.J., Jaakkola, T.S., Willsky, A.S.: MAP estimation via agreement on (hyper)trees: Message-passing and linear-programming approaches. IEEE Transactions on Information Theory 51(11), 3697-3717 (2005)
23. Werner, T.: A linear programming approach to max-sum problem: A review. PAMI 29(7), 1165-1179 (2007)