Emergent Mind
All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Kernels with Quadratic Numbers of Variables
(1004.1956)
Published Apr 12, 2010
in
cs.DS
and
cs.DM
Abstract
A ternary Permutation-CSP is specified by a subset $\Pi$ of the symmetric group $\mathcal S_3$. An instance of such a problem consists of a set of variables $V$ and a multiset of constraints, which are ordered triples of distinct variables of $V.$ The objective is to find a linear ordering $\alpha$ of $V$ that maximizes the number of triples whose ordering (under $\alpha$) follows a permutation in $\Pi$. We prove that all ternary Permutation-CSPs parameterized above average have kernels with quadratic numbers of variables.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.