Constraint Satisfaction Parameterized by Solution Size
نویسندگان
چکیده
منابع مشابه
Constraint Satisfaction Parameterized by Solution Size
In the constraint satisfaction problem (CSP) corresponding to a constraint language (i.e., a set of relations) Γ, the goal is to find an assignment of values to variables so that a given set of constraints specified by relations from Γ is satisfied. The complexity of this problem has received substantial amount of attention in the past decade. In this paper, we study the fixed-parameter tractab...
متن کاملParameterized Constraint Satisfaction Problems: a Survey
We consider constraint satisfaction problems parameterized above or below guaranteed values. One example is MaxSat parameterized above m/2: given a CNF formula F with m clauses, decide whether there is a truth assignment that satisfies at least m/2 + k clauses, where k is the parameter. Among other problems we deal with are MaxLin2-AA (given a system of linear equations over F2 in which each eq...
متن کاملImproved Parameterized Algorithms for Constraint Satisfaction
Results from inapproximability provide several sharp thresholds on the approximability of important optimization problems. We give several improved parameterized algorithms for solving constraint satisfaction problems above a tight threshold. Our results include the following: • Improved algorithms for any Constraint Satisfaction Problem. Take any boolean Max-CSP with at most c variables per co...
متن کاملThe Parameterized Complexity of Constraint Satisfaction and Reasoning
Parameterized Complexity is a new and increasingly popular theoretical framework for the rigorous analysis of NP-hard problems and the development of algorithms for their solution. The framework provides adequate concepts for taking structural aspects of problem instances into account. We outline the basic concepts of Parameterized Complexity and survey some recent parameterized complexity resu...
متن کاملParameterized algorithms on digraph and constraint satisfaction problems
While polynomial-time approximation algorithms remain a dominant notion in tackling computationally hard problems, the framework of parameterized complexity has been emerging rapidly in recent years. Roughly speaking, the analytic framework of parameterized complexity attempts to grasp the difference between problems which admit O(ck · poly(n))-time algorithms such as Vertex Cover, and problems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2014
ISSN: 0097-5397,1095-7111
DOI: 10.1137/120882160