A dichotomy theorem for maximum generalized satisfiability problems
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Complexity of generalized satisfiability counting problems
Information and Computation
Algorithmic complexity in coding theory and the minimum distance problem
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Computing All Small Cuts in an Undirected Network
SIAM Journal on Discrete Mathematics
Global min-cuts in RNC, and other ramifications of a simple min-out algorithm
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
The Approximability of Constraint Satisfaction Problems
SIAM Journal on Computing
Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
The Approximability of Three-valued MAX CSP
SIAM Journal on Computing
Optimal algorithms and inapproximability results for every CSP?
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The complexity of soft constraint satisfaction
Artificial Intelligence
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Computing vertex-surjective homomorphisms to partially reflexive trees
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Min CSP on four elements: moving beyond submodularity
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The computational complexity of disconnected cut and 2K2-partition
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The complexity of conservative valued CSPs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Journal of Computer and System Sciences
The complexity of surjective homomorphism problems-a survey
Discrete Applied Mathematics
| Hi-index | 0.00 |
Max-Sur-CSP is the following optimisation problem: given a set of constraints, find a surjective mapping of the variables to domain values that satisfies as many of the constraints as possible. Many natural problems, e.g. Minimum k-Cut (which has many different applications in a variety of fields) and Minimum Distance (which is an important problem in coding theory), can be expressed as Max-Sur-CSPs. We study Max-Sur-CSP on the two-element domain and determine the computational complexity for all constraint languages (families of allowed constraints). Our results show that the problem is solvable in polynomial time if the constraint language belongs to one of three classes, and NP-hard otherwise. An important part of our proof is a polynomial-time algorithm for enumerating all near-optimal solutions to a generalised minimum cut problem. This algorithm may be of independent interest.