Near-optimal algorithms for maximum constraint satisfaction problems

@inproceedings{Charikar2007NearoptimalAF,
  title={Near-optimal algorithms for maximum constraint satisfaction problems},
  author={Moses Charikar and Konstantin Makarychev and Yury Makarychev},
  booktitle={SODA '07},
  year={2007}
}
  • Moses Charikar, Konstantin Makarychev, Yury Makarychev
  • Published in SODA '07 2007
  • Mathematics, Computer Science
  • In this paper we present approximation algorithms for the maximum constraint satisfaction problem with <i>k</i> variables in each constraint (MAX <i>k</i>-CSP). Given a (1 - ε) satisfiable 2CSP our first algorithm finds an assignment of variables satisfying a 1 - <i>O</i>(√ε) fraction of all constraints. The best previously known result, due to Zwick, was 1 - <i>O</i>(ε<sup>1/3</sup>). The second algorithm finds a <i>ck</i>/2<sup><i>k</i></sup> approximation for the MAX <i>k</i>-CSP problem… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 56 CITATIONS

    Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs

    VIEW 8 EXCERPTS
    CITES METHODS

    Approximating kCSP For Large Alphabets

    VIEW 7 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    On the Power of Lasserre SDP Hierarchy

    VIEW 5 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    Approximation Algorithm for Non-boolean MAX k-CSP

    VIEW 7 EXCERPTS
    CITES METHODS

    The approximability of learning and constraint satisfaction problems

    VIEW 17 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    CSP gaps and reductions in the lasserre hierarchy

    VIEW 3 EXCERPTS
    HIGHLY INFLUENCED

    Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness

    VIEW 7 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Hardness of Maximum Constraint Satisfaction

    VIEW 2 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    Approximate Inference by Intersecting Semidefinite Bound and Local Polytope

    VIEW 4 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Approximation resistance from pairwise independent subgroups

    VIEW 7 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    FILTER CITATIONS BY YEAR

    2005
    2019

    CITATION STATISTICS

    • 10 Highly Influenced Citations

    References

    Publications referenced by this paper.
    SHOWING 1-6 OF 6 REFERENCES

    On the power of unique 2-prover 1-round games

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    Gowers Uniformity

    • A. Samorodnitsky, L. Trevisan
    • Influence of Variables, and PCPs. In Proceedings of the 38th ACM symposium on Theory of computing, pp. 11-20
    • 2006
    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL