2026-07-26T17:23:12Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:10291 2024-03-06T10:45:44Z ddc:004 open_access

Beyond Boolean Surjective VCSPs Matl, Gregor Živný, Stanislav constraint satisfaction problems valued constraint satisfaction surjective constraint satisfaction graph cuts Fulla, Uppman, and Živný [ACM ToCT'18] established a dichotomy theorem for Boolean surjective general-valued constraint satisfaction problems (VCSPs), i.e., VCSPs on two-element domains in which both labels have to be used in a solution. This result, in addition to identifying the complexity frontier, features the discovery of a new non-trivial tractable case (called EDS) that does not appear in the non-surjective setting. In this work, we go beyond Boolean domains. As our main result, we introduce a generalisation of EDS to arbitrary finite domains called SEDS (similar to EDS) and establish a conditional complexity classification of SEDS VCSPs based on a reduction to smaller domains. This gives a complete classification of SEDS VCSPs on three-element domains. The basis of our tractability result is a natural generalisation of the Min-Cut problem, in which only solutions of certain size (given by a lower and upper bound) are permitted. We show that all near-optimal solutions to this problem can be enumerated in polynomial time, which might be of independent interest. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Gregor Matl and Stanislav Živný 2019 Is Part Of LIPIcs, Volume 126, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2019.52 urn:nbn:de:0030-drops-102911 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.52 eng https://creativecommons.org/licenses/by/3.0/legalcode