Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables

Gregory Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

A ternary permutation-csp is specified by a subset p of the symmetric group s3. 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 every ternary permutation-csp parameterized above average has a kernel with a quadratic number of variables.
Original languageEnglish
Pages (from-to)151-163
JournalJournal of Computer and System Sciences
Volume78
Issue number1
DOIs
Publication statusPublished - 2012
Externally publishedYes

Cite this