All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels

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

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

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.
Original languageEnglish
Title of host publicationAlgorithms - ESA 2010
Subtitle of host publication18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I
PublisherSpringer
Pages326-337
DOIs
Publication statusPublished - 2010
Externally publishedYes

Publication series

SeriesLecture Notes in Computer Science
Volume6346

Fingerprint

Dive into the research topics of 'All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels'. Together they form a unique fingerprint.

Cite this