A characterisation of the complexity of forbidding subproblems in binary Max-CSP

Authors:
Martin C. Cooper;Guillaume Escamocher;Stanislav Živný
Affiliations:
IRIT, University of Toulouse III, Toulouse, France;IRIT, University of Toulouse III, Toulouse, France;Department of Computer Science, University of Oxford, Oxford, UK
Venue:
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Year:
2012

Citing 15
Cited 0

Complexity classifications of boolean constraint satisfaction problems

Complexity classifications of boolean constraint satisfaction problems
Nonserial Dynamic Programming

Nonserial Dynamic Programming
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Constraint Processing

Constraint Processing
Cluster graph modification problems

Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
The Approximability of Three-valued MAX CSP

SIAM Journal on Computing
The complexity of homomorphism and constraint satisfaction problems seen from the other side

Journal of the ACM (JACM)
The approximability of MAX CSP with fixed-value constraints

Journal of the ACM (JACM)
A faster strongly polynomial time algorithm for submodular function minimization

Mathematical Programming: Series A and B
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination

Artificial Intelligence
MAX-CUT and containment relations in graphs

WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Hybrid tractability of valued constraint problems

Artificial Intelligence
Hierarchically nested convex VCSP

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Tractable triangles

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Min CSP on four elements: moving beyond submodularity

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tractable classes of binary CSP and binary Max-CSP have recently been discovered by studying classes of instances defined by excluding subproblems. In this paper we characterise the complexity of all classes of binary Max-CSP instances defined by forbidding a single subproblem. In the resulting dichotomy, the only non-trivial tractable class defined by a forbidden subproblem corresponds to the set of instances satisfying the so-called joint-winner property.