The approximability of MAX CSP with fixed-value constraints

Details The approximability of MAX CSP with fixed-value constraints The approximability of MAX CSP with fixed-value constraints

2006-02-21

arxiv.org/abs/cs/0602075v1

Computer Science

Computational Complexity

Scientific paper

In the maximum constraint satisfaction problem (MAX CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to assign values from a given finite domain to the variables so as to maximize the number (or the total weight, for the weighted case) of satisfied constraints. This problem is NP-hard in general, and, therefore, it is natural to study how restricting the allowed types of constraints affects the approximability of the problem. In this paper, we show that any MAX CSP problem with a finite set of allowed constraint types, which includes all fixed-value constraints (i.e., constraints of the form x=a), is either solvable exactly in polynomial-time or else is APX-complete, even if the number of occurrences of variables in instances are bounded. Moreover, we present a simple description of all polynomial-time solvable cases of our problem. This description relies on the well-known algebraic combinatorial property of supermodularity.

Affiliated with

Also associated with

No associations

Rating

The approximability of MAX CSP with fixed-value constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The approximability of MAX CSP with fixed-value constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The approximability of MAX CSP with fixed-value constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-454099