Approximation Algorithm for Non-Boolean MAX k-CSP
Data Structures and Algorithms
2012-06-19 v1
Abstract
In this paper, we present a randomized polynomial-time approximation algorithm for k-CSPd. In k-CSPd, we are given a set of predicates of arity k over an alphabet of size d. Our goal is to find an assignment that maximizes the number of satisfied constraints. Our algorithm has approximation factor Omega(kd/d^k) (when k > \Omega(log d)). This bound is asymptotically optimal assuming the Unique Games Conjecture. The best previously known algorithm has approximation factor Omega(k log d/d^k). We also give an approximation algorithm for the boolean MAX k-CSP2 problem with a slightly improved approximation guarantee.
Keywords
Cite
@article{arxiv.1206.3603,
title = {Approximation Algorithm for Non-Boolean MAX k-CSP},
author = {Konstantin Makarychev and Yury Makarychev},
journal= {arXiv preprint arXiv:1206.3603},
year = {2012}
}
Comments
The conference version of this paper will appear in the Proceedings of APPROX 2012