Betweenness parameterized above tight lower bound
Journal of Computer and System Sciences
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Characterization and representation problems for intersection betweennesses
Discrete Applied Mathematics
Restricted common superstring and restricted common supersequence
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Approximation schemes for the betweenness problem in tournaments and related ranking problems
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
On subbetweennesses of trees: Hardness, algorithms, and characterizations
Computers & Mathematics with Applications
Journal of Computer and System Sciences
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
SIAM Journal on Computing
Improved parameterized algorithms for above average constraint satisfaction
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Parameterized complexity of maxsat above average
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Constraint satisfaction problems parameterized above or below tight bounds: a survey
The Multivariate Algorithmic Revolution and Beyond
Parameterized complexity of MaxSat Above Average
Theoretical Computer Science
Hi-index | 0.00 |
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 of constraint satisfaction problems over finite domains (such as Boolean CSPs) to the world of ordering problems. The simplest permCSP corresponds to the case when $\Lambda$ consists of the identity permutation on two variables. This is just the Maximum Acyclic Subgraph (\mas) problem. It was recently shown that the \mas\ problem is Unique-Games hard to approximate within a factor better than the trivial $1/2$ achieved by a random ordering [GMR08]. Building on this work, in this paper we show that for *every* permCSP of arity $3$, beating the random ordering is Unique-Games hard. The result is in fact stronger: we show that for every $\Lambda \subseteq \Pi \subseteq S_3$, given an instance of permCSP$(\Lambda)$ that is almost-satisfiable, it is hard to find an ordering that satisfies more than $\frac{|\Pi|}{6} +\eps$ of the constraints even under the relaxed constraint $\Pi$ (for arbitrary $\eps 0$). A special case of our result is that the *Betweenness* problem is hard to approximate beyond a factor $1/3$. Interestingly, for *satisfiable* instances of Betweenness, a factor $1/2$ approximation algorithm is known. Thus, every permutation CSP of arity up to $3$ resists approximation beyond the trivial random ordering threshold. In contrast, for Boolean CSPs, there are both approximation resistant and non-trivially approximable CSPs of arity $3$.