Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains

Valued constraint satisfaction problems (VCSPs) are a large class of combinatorial optimisation problems. It is desirable to classify the computational complexity of VCSPs depending on a fixed set of allowed cost functions in the input. Recently, the computational complexity of all VCSPs for finite sets of cost functions over finite domains has been classified in this sense. Many natural optimisation problems, however, cannot be formulated as VCSPs over a finite domain. We initiate the systematic investigation of infinite-domain VCSPs by studying the complexity of VCSPs for piecewise linear homogeneous cost functions. We show that such VCSPs can be solved in polynomial time when the cost functions are additionally submodular, and that this is indeed a maximally tractable class: adding any cost function that is not submodular leads to an NP-hard VCSP.

[1]  Manuel Bodirsky,et al.  Constraint satisfaction tractability from semi-lattice operations on infinite sets , 2013, TOCL.

[2]  Manuel Bodirsky,et al.  Tropically Convex Constraint Satisfaction , 2015, Theory of Computing Systems.

[3]  Satoru Iwata,et al.  A fully combinatorial algorithm for submodular function minimization , 2001, SODA '02.

[4]  A. Wilkie.  TAME TOPOLOGY AND O-MINIMAL STRUCTURES (London Mathematical Society Lecture Note Series 248) By L OU VAN DEN D RIES : 180 pp., £24.95 (US$39.95, LMS Members' price £18.70), ISBN 0 521 59838 9 (Cambridge University Press, 1998). , 2000 .

[5]  Lenore Blum,et al.  Complexity and Real Computation , 1997, Springer New York.

[6]  Charles Steinhorn,et al.  Tame Topology and O-Minimal Structures , 2008 .

[7]  Vladimir Kolmogorov,et al.  The Power of Linear Programming for General-Valued CSPs , 2013, SIAM J. Comput..

[8]  Alexander Schrijver,et al.  A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.

[9]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[10]  Peter Jonsson,et al.  Min CSP on Four Elements: Moving beyond Submodularity , 2011, CP.

[11]  Satoru Iwata,et al.  A simple combinatorial algorithm for submodular function minimization , 2009, SODA.

[12]  藤重 悟.  Submodular functions and optimization , 1991 .

[13]  Jeanne Ferrante,et al.  A Decision Procedure for the First Order Theory of Real Addition with Order , 1975, SIAM J. Comput..

[14]  Vladimir Kolmogorov,et al.  The Complexity of General-Valued CSPs , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[15]  Marcin Kozik,et al.  Algebraic Properties of Valued Constraint Satisfaction Problem , 2014, ICALP.

[16]  Martin C. Cooper,et al.  The complexity of soft constraint satisfaction , 2006, Artif. Intell..

[17]  Wilfrid Hodges,et al.  A Shorter Model Theory , 1997 .

[18]  Manuel Bodirsky,et al.  Non-dichotomies in Constraint Satisfaction Complexity , 2008, ICALP.

[19]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[20]  Manuel Bodirsky,et al.  Max-Closed Semilinear Constraint Satisfaction , 2016, CSR.

[21]  Andrei A. Bulatov,et al.  A Dichotomy Theorem for Nonuniform CSPs , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[22]  Dmitriy Zhuk,et al.  A Proof of CSP Dichotomy Conjecture , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).