Parameterized complexity of MinCSP over the Point Algebra
The input in the Minimum-Cost Constraint Satisfaction Problem (MinCSP) over the Point
Algebra contains a set of variables, a collection of constraints of the form x< y, x= y, x≤ y and …
Algebra contains a set of variables, a collection of constraints of the form x< y, x= y, x≤ y and …
Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings
We consider the MIN-r-LIN (R) problem: given a system S of length-r linear equations over a
ring R, find a subset of equations Z of minimum cardinality such that SZ is satisfiable. The …
ring R, find a subset of equations Z of minimum cardinality such that SZ is satisfiable. The …
Temporal Valued Constraint Satisfaction Problems
We study the complexity of the valued constraint satisfaction problem (VCSP) for every
valued structure with the domain ${\mathbb Q} $ that is preserved by all order-preserving …
valued structure with the domain ${\mathbb Q} $ that is preserved by all order-preserving …
[PDF][PDF] Parameterized Complexity Classification for Interval Constraints
Constraint satisfaction problems form a nicely behaved class of problems that lends itself to
complexity classification results. From the point of view of parameterized complexity, a …
complexity classification results. From the point of view of parameterized complexity, a …
Directed Symmetric Multicut is W [1]-hard
Given a directed graph $ G $ and a set of vertex pairs $\{(s_1, t_1),\dots,(s_m, t_m)\} $, the
Directed Symmetric Multicut problem asks to delete the minimum number of edges from $ G …
Directed Symmetric Multicut problem asks to delete the minimum number of edges from $ G …