A General Class of Greedily Solvable Linear Programs
Mathematics of Operations Research
A combinatorial algorithm minimizing submodular functions in strongly polynomial time
Journal of Combinatorial Theory Series B
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM (JACM)
The Approximability of Three-valued MAX CSP
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
Optimal algorithms and inapproximability results for every CSP?
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The approximability of MAX CSP with fixed-value constraints
Journal of the ACM (JACM)
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
Mathematical Programming: Series A and B
The complexity of soft constraint satisfaction
Artificial Intelligence
An algebraic theory of complexity for valued constraints: establishing a Galois connection
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
An algebraic characterisation of complexity for valued constraint
CP'06 Proceedings of the 12th 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
Towards minimizing k-submodular functions
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Tractable triangles and cross-free convexity in discrete optimisation
Journal of Artificial Intelligence Research
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
A characterisation of the complexity of forbidding subproblems in binary Max-CSP
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
The complexity of conservative valued CSPs
Journal of the ACM (JACM)
The complexity of finite-valued CSPs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
The complexity of three-element min-sol and conservative min-cost-hom
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Robust Satisfiability for CSPs: Hardness and Algorithmic Results
ACM Transactions on Computation Theory (TOCT)
Hi-index | 0.00 |
We report new results on the complexity of the valued constraint satisfaction problem (VCSP). Under the unique games conjecture, the approximability of finite-valued VCSP is fairly well-understood. However, there is yet no characterisation of VCSPs that can be solved exactly in polynomial time. This is unsatisfactory, since such results are interesting from a combinatorial optimisation perspective; there are deep connections with, for instance, submodular and bisubmodular minimisation. We consider the Min and Max CSP problems (i.e. where the cost functions only attain values in {0, 1}) over four-element domains and identify all tractable fragments. Similar classifications were previously known for two- and three-element domains. In the process, we introduce a new class of tractable VCSPs based on a generalisation of submodularity. We also extend and modify a graph-based technique by Kolmogorov and Živny (originally introduced by Takhanov) for efficiently obtaining hardness results in our setting. This allow us to prove the result without relying on computer-assisted case analyses (which is fairly common when studying VCSPs). The hardness results are further simplified by the introduction of powerful reduction techniques.