Every Permutation CSP of arity 3 is Approximation Resistant

  title={Every Permutation CSP of arity 3 is Approximation Resistant},
  author={Moses Charikar and Venkatesan Guruswami and Rajsekar Manokaran},
  journal={2009 24th Annual IEEE Conference on Computational Complexity},
A permutation constraint satisfaction problem (permCSP) of arity k is specified by a subset Lambda of permutations on $\{1,2,\dots,k\}$. An instance of such a permCSP consists of a set of variables $V$ and a collection of constraints each of which is an ordered $k$-tuple of $V$. The objective is to find a global ordering $\sigma$ of the variables that maximizes the number of constraint tuples whose ordering (under $\sigma$) follows a permutation in $\Lambda$. This is just the natural extension… Expand
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
We prove that, assuming the Unique Games conjecture (UGC), every problem in the class of ordering constraint satisfaction problems (OCSPs) where each constraint has constant arity is approximationExpand
Improved Parameterized Algorithms for Constraint Satisfaction
A faster parameterized algorithm for deciding whether $m/2+k/2$ equations can be simultaneously satisfied over ${\mathbb F}_2$ and obtaining non-trivial hybrid algorithms for every Max $c$-CSP. Expand
Approximating bounded occurrence ordering CSPs
A theorem of Håstad shows that for every constraint satisfaction problem (CSP) over a fixed size domain, instances where each variable appears in at most O(1) constraints admit a non-trivialExpand
Satisfiability of Ordering CSPs Above Average
A new Bonami-type inequality for the Efron-Stein decomposition is proved that applies to functions defined on arbitrary product probability spaces and does not depend on the mass of the smallest atom in the probability space. Expand
Approximating Bounded Occurrence Ordering CSPs
A theorem of Hastad shows that for every constraint satisfaction problem (CSP) over a fixed size domain, instances where each variable appears in at most O(1) constraints admit a non-trivialExpand
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
It is proved that every ternary Permutation-CSP parameterized above average has a kernel with a quadratic number of variables. Expand
Finding an Optimal Alphabet Ordering for Lyndon Factorization Is Hard
This work demonstrates that these ordering problems are sufficiently complex to model a wide variety of ordering constraint satisfaction problems (OCSPs) and proves that the decision versions of both the minimization and maximization problems are NPcomplete. Expand
On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems
These results provide the first examples of approximation-resistant OCSPs subject only to P $\neq$ \NP, and it is proved that the Maximum Non-Betweenness Problem is approximation resistant and that there are width-$m$ approximation- resistantOCSPs accepting only a fraction of assignments. Expand
Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs
We prove that the Bounded Occurrence Ordering k-CSP Problem is not approximation resistant. We give a very simple local search algorithm that always performs better than the random assignmentExpand
Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction
We give the first examples of non-trivially positively-useless predicates subject only to P != NP. In particular, for every constraint function Q : {-1,1}^4 -> R, we constructExpand


Is Constraint Satisfaction Over Two Variables Always Easy?
By the breakthrough work of Hastad, several constraint satisfaction problems are now known to have the following approximation resistance property: satisfying more clauses than what picking a randomExpand
Is constraint satisfaction over two variables always easy?
It is proved that a slight restriction of this problem, namely, a generalization of linear inequations with two variables per constraint, is not approximation resistant, and, second, that the Not-All-Equal Sat problem over domain size d with three variables per constraints, is approximation resistant. Expand
Beating a Random Assignment
  • Gustav Hast
  • Mathematics, Computer Science
  • 2005
For a multitude of different P, it is shown that the algorithm beats the random assignment algorithm, thus implying that P is not approximation resistant, and a large number of predicates are proved to be approximation resistant. Expand
Every 2-csp Allows Nontrivial Approximation
  • J. Håstad
  • Mathematics, Computer Science
  • computational complexity
  • 2008
Abstract.We use semidefinite programming to prove that any constraint satisfaction problem in two variables over any domain allows an efficient approximation algorithm that does better than picking aExpand
A Geometric Approach to Betweenness
This paper presents a polynomial time algorithm that either determines that there is no feasible solution or finds a total order that satisfies at least 1/2 of the m constraints, and translates the problem into a set of quadratic inequalities and solves a semidefinite relaxation of them in R. Expand
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the max. acyclic subgraph problem within a factor better than 1/2 is unique games hard. Specifically, for every constant epsiv > 0 the following holds: given a directedExpand
Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint
  • U. Zwick
  • Mathematics, Computer Science
  • SODA '98
  • 1998
A gapproximation algorithm for satisfiable instances of MAX 3CSP and limits on the power of non-adaptive verifiers of probabilistically checkable proofs that read only three bits of the proof are implied. Expand
Towards Sharp Inapproximability For Any 2-CSP
  • Per Austrin
  • Mathematics, Computer Science
  • 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)
  • 2007
It is shown how to reduce the search for a good inapproximability result to a certain numeric minimization problem, and conjecture that the restricted type required for the hardness result is in fact no restriction, which would imply that these upper and lower bounds match exactly. Expand
Optimal algorithms and inapproximability results for every CSP?
A generic conversion from SDP integrality gaps to UGC hardness results for every CSP is shown, which achieves at least as good an approximation ratio as the best known algorithms for several problems like MaxCut, Max2Sat, MaxDiCut and Unique Games. Expand
Vertex cover might be hard to approximate to within 2-epsilon
A stronger result is shown, namely, based on the same conjecture, vertex cover on k-uniform hypergraphs is hard to approximate within any constant factor better than k. Expand