Abstract
A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. An instance of the problem is specified by a sum of cost functions from the language with the goal to minimise the sum.
We study which classes of finite-valued languages can be solved exactly by the basic linear programming relaxation (BLP). Thapper and Živný showed [20] that if BLP solves the language then the language admits a binary commutative fractional polymorphism. We prove that the converse is also true. This leads to a necessary and a sufficient condition which can be checked in polynomial time for a given language. In contrast, the previous necessary and sufficient condition due to [20] involved infinitely many inequalities.
More recently, Thapper and Živný [21] showed (using, in particular, a technique introduced in this paper) that core languages that do not satisfy our condition are NP-hard. Taken together, these results imply that a finite-valued language can either be solved using Linear Programming or is NP-hard.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blake, A., Kohli, P., Rother, C. (eds.): Advances in Markov Random Fields for Vision and Image Processing. MIT Press (2011)
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)
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)
Cohen, D., Cooper, M., Jeavons, P., Krokhin, A.: The complexity of soft constraint satisfaction. Artificial Intelligence 170(11), 983–1016 (2006)
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)
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)
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)
Huber, A., Krokhin, A., Powell, R.: Skew bisubmodularity and valued CSPs. In: SODA (2013)
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)
Kolmogorov, V.: Convergent tree-reweighted messages passing. PAMI 28(10), 1568–1583 (2006)
Kolmogorov, V., Schoenemann, T.: Generalized sequential tree-reweighted message passing. CoRR, abs/1205.6352 (2012)
Kolmogorov, V.: The power of linear programming for valued CSPs: a constructive characterization. ArXiv, abs/1207.7213v4 (2012)
Kolmogorov, V., Živný, S.: The complexity of conservative valued CSPs. In: SODA (2012)
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)
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)
Raghavendra, P.: Approximating NP-hard Problems: Efficient Algorithms and their Limits. PhD Thesis (2009)
Savchynskyy, B., Schmidt, S., Kappes, J.H., Schnörr, C.: Efficient MRF energy minimization via adaptive diminishing smoothing. In: UAI (2012)
Schlesinger, M.I.: Syntactic analysis of two-dimensional visual signals in noisy conditions. Kibernetika 4, 113–130 (1976) (in Russian)
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)
Thapper, J., Živný, S.: The power of linear programming for valued CSPs. In: FOCS (2012)
Thapper, J., Živný, S.: The complexity of finite-valued CSPs. ArXiv, abs/1210.2987 (2012); To appear in STOC 2013
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)
Werner, T.: A linear programming approach to max-sum problem: A review. PAMI 29(7), 1165–1179 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kolmogorov, V. (2013). The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds) Automata, Languages, and Programming. ICALP 2013. Lecture Notes in Computer Science, vol 7965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39206-1_53
Download citation
DOI: https://doi.org/10.1007/978-3-642-39206-1_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39205-4
Online ISBN: 978-3-642-39206-1
eBook Packages: Computer ScienceComputer Science (R0)