The Complexity of Boolean Surjective General-Valued CSPs

Valued constraint satisfaction problems (VCSPs) are discrete optimisation problems with a (Q ∪ {∞})-valued objective function given as a sum of fixed-arity functions. In Boolean surjective VCSPs, variables take on labels from D = {0, 1} and an optimal assignment is required to use both labels from D. Examples include the classical global Min-Cut problem in graphs and the Minimum Distance problem studied in coding theory. We establish a dichotomy theorem and thus give a complete complexity classification of Boolean surjective VCSPs with respect to exact solvability. Our work generalises the dichotomy for {0,∞}-valued constraint languages (corresponding to surjective decision CSPs) obtained by Creignou and Hébrard. For the maximisation problem of Q≥0-valued surjective VCSPs, we also establish a dichotomy theorem with respect to approximability. Unlike in the case of Boolean surjective (decision) CSPs, there appears a novel tractable class of languages that is trivial in the non-surjective setting. This newly discovered tractable class has an interestingmathematical structure related to downsets and upsets. Our main contribution is identifying this class and proving that it lies on the borderline of tractability. A crucial part of our proof is a polynomial-time algorithm for enumerating all near-optimal solutions to a generalised Min-Cut problem, which might be of independent interest.

[1]  Mohit Singh,et al.  On the Approximation of Submodular Functions , 2013, ArXiv.

[2]  Jirí Fiala,et al.  A complete complexity classification of the role assignment problem , 2005, Theor. Comput. Sci..

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

[4]  Hang Zhou,et al.  Approximation for Maximum Surjective Constraint Satisfaction Problems , 2011, ArXiv.

[5]  Subhash Khot,et al.  On the Unique Games Conjecture (Invited Survey) , 2005, 2010 IEEE 25th Annual Conference on Computational Complexity.

[6]  Daniël Paulusma,et al.  The computational complexity of disconnected cut and 2K2-partition , 2011, J. Comb. Theory, Ser. B.

[7]  Martin C. Cooper,et al.  An Algebraic Theory of Complexity for Discrete Optimization , 2012, SIAM J. Comput..

[8]  Toshihide Ibaraki,et al.  Algorithmic Aspects of Graph Connectivity , 2008, Encyclopedia of Mathematics and its Applications.

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

[10]  Jian Song,et al.  Computing vertex-surjective homomorphisms to partially reflexive trees , 2011, Theor. Comput. Sci..

[11]  Nadia Creignou,et al.  On Generating All Solutions of Generalized Satisfiability Problems , 1997, RAIRO Theor. Informatics Appl..

[12]  Mechthild Stoer,et al.  A simple min-cut algorithm , 1997, JACM.

[13]  Daniël Paulusma,et al.  The Computational Complexity of Disconnected Cut and 2K 2-Partition , 2011, CP.

[14]  Hubie Chen.  An algebraic hardness criterion for surjective constraint satisfaction , 2014, ArXiv.

[15]  Pierluigi Crescenzi,et al.  A short guide to approximation preserving reductions , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[16]  Dániel Marx,et al.  Enumerating Homomorphisms , 2009, STACS.

[17]  Konstantin Makarychev,et al.  Approximation Algorithms for CSPs , 2017, The Constraint Satisfaction Problem.

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

[19]  Barnaby Martin,et al.  The complexity of surjective homomorphism problems - a survey , 2011, Discret. Appl. Math..

[20]  Peter Jeavons,et al.  Classifying the Complexity of Constraints Using Finite Algebras , 2005, SIAM J. Comput..

[21]  Alexander Vardy,et al.  Algorithmic complexity in coding theory and the minimum distance problem , 1997, STOC '97.

[22]  Andrei A. Bulatov,et al.  A dichotomy theorem for constraint satisfaction problems on a 3-element set , 2006, JACM.

[23]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[24]  Narayan Vikas.  Algorithms for Partition of Some Class of Graphs under Compaction and Vertex-Compaction , 2012, Algorithmica.

[25]  Peter Jonsson,et al.  The Approximability of Three-valued MAX CSP , 2004, SIAM J. Comput..

[26]  ThapperJohan,et al.  The Complexity of Finite-Valued CSPs , 2016 .

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

[28]  Petr A. Golovach,et al.  Finding vertex-surjective graph homomorphisms , 2012, Acta Informatica.

[29]  Andrei A. Krokhin,et al.  The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231) , 2018, Dagstuhl Reports.

[30]  Libor Barto,et al.  Polymorphisms, and How to Use Them , 2017, The Constraint Satisfaction Problem.

[31]  Prasad Raghavendra,et al.  Optimal algorithms and inapproximability results for every CSP? , 2008, STOC.

[32]  Hannes Uppman.  Max-Sur-CSP on Two Elements , 2012, CP.

[33]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[34]  Nadia Creignou,et al.  A Dichotomy Theorem for Maximum Generalized Satisfiability Problems , 1995, J. Comput. Syst. Sci..

[35]  Jirí Fiala,et al.  Locally constrained graph homomorphisms - structure, complexity, and applications , 2008, Comput. Sci. Rev..

[36]  A. Frank.  Connections in Combinatorial Optimization , 2011 .

[37]  Mihalis Yannakakis,et al.  Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract) , 1992, ICALP.

[38]  Alon Itai,et al.  Finding All Solutions if You can Find One , 1992 .

[39]  David R. Karger,et al.  Global min-cuts in RNC, and other ramifications of a simple min-out algorithm , 1993, SODA '93.

[40]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[41]  Stanislav Zivny,et al.  The complexity of finite-valued CSPs , 2013, STOC '13.

[42]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[43]  David A. Cohen,et al.  Tractable Decision for a Constraint Language Implies Tractable Search , 2004, Constraints.

[44]  Libor Barto,et al.  Constraint satisfaction problem and universal algebra , 2014, SIGL.

[45]  P. Raghavendra,et al.  Approximating np-hard problems efficient algorithms and their limits , 2009 .

[46]  Stanislav Zivny,et al.  A Galois Connection for Valued Constraint Languages of Infinite Size , 2015, ICALP.

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

[48]  Libor Barto,et al.  Constraint Satisfaction Problems Solvable by Local Consistency Methods , 2014, JACM.

[49]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[50]  Anna Huber,et al.  Skew Bisubmodularity and Valued CSPs , 2013, SIAM J. Comput..