All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables

DOI10.1007/978-3-642-15775-2_28zbMath1287.68074arXiv1004.1956OpenAlexW2019583540MaRDI QIDQ3586474

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

Publication date: 6 September 2010

Published in: Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1004.1956

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (7)

On Multiway Cut Parameterized above Lower Bounds ⋮ Improved Parameterized Algorithms for above Average Constraint Satisfaction ⋮ Kernelization – Preprocessing with a Guarantee ⋮ A probabilistic approach to problems parameterized above or below tight bounds ⋮ Betweenness parameterized above tight lower bound ⋮ Lower bounds on kernelization ⋮ Unnamed Item

This page was built for publication: All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables