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.
|Title of host publication||Algorithms - ESA 2010|
|Subtitle of host publication||18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I|
|Publication status||Published - 2010|
|Series||Lecture Notes in Computer Science|