@inproceedings{8bc17362452e4277a46c5001b772792f,

title = "All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels",

abstract = "A ternary permutation-csp is specified by a subset p of the symmetric group \mathcal s_3\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 a of v that maximizes the number of triples whose rearrangement (under a) follows a permutation in p. We prove that all ternary permutation-csps parameterized above average have kernels with quadratic numbers of variables.",

author = "Gregory Gutin and {van Iersel}, Leo and Matthias Mnich and Anders Yeo",

year = "2010",

doi = "10.1007/978-3-642-15775-2_28",

language = "English",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "326--337",

booktitle = "Algorithms - ESA 2010",

address = "United States",

}