On the kernelization of ranking r-CSPs: Linear vertex-kernels for generalizations of Feedback Arc Set and Betweenness in tournaments

An instance of a rankingr-constraint satisfaction problem (ranking r-CSP for short) consists of a ground set of vertices V, an arity r⩾2, a parameter k∈N and a constraint systemc, where c is a function which maps rankings of r-sized sets S⊆V to {0,1}. The objective is to decide if there exists a ran...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 186; pp. 214 - 225
Main Author:	Perez, Anthony
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 11.05.2015 Elsevier
Subjects:	Computer Science Data Structures and Algorithms Dense instances Kernelization algorithms Parameterized complexity Ranking CSP Dense instances Kernelization algorithms Parameterized complexity Ranking CSP
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!