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...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 186; s. 214 - 225
Hlavný autor:	Perez, Anthony
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 11.05.2015 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!