A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Every Permutation CSP of arity 3 is Approximation Resistant

2009
*
2009 24th Annual IEEE Conference on Computational Complexity
*

A permutation constraint satisfaction problem (permCSP) of arity k is specified by a subset Λ ⊆ S k of permutations on {1, 2, . . . , 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 σ of the variables that maximizes the number of constraint tuples whose ordering (under σ) follows a permutation in Λ. This is just the natural extension of constraint satisfaction

doi:10.1109/ccc.2009.29
dblp:conf/coco/CharikarGM09
fatcat:paxbuwhb2nam7lmxcr7ntluw5m