A ternary Permutation-CSP is specified by a subset Π 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 α of V that maximizes the number of triples whose rearrangement (under α) follows a permutation in Π. We prove that all ternary Permutation-CSPs parameterized above average have kernels with quadratic numbers of variables. © 2010 Springer-Verlag.
CITATION STYLE
Gutin, G., Van Iersel, L., Mnich, M., & Yeo, A. (2010). All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6346 LNCS, pp. 326–337). https://doi.org/10.1007/978-3-642-15775-2_28
Mendeley helps you to discover research relevant for your work.