Smaller Kernels for Hitting Set Problems of Constant Arity

We demonstrate a kernel of size O(k2) for 3-Hitting Set (Hitting Set when all subsets in the collection to be hit are of size at most three), giving a partial answer to an open question of Niedermeier by improving on the O(k3) kernel of Niedermeier and Rossmanith. Our technique uses the Nemhauser-Tr...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Nishimura, Naomi, Ragde, Prabhakar, Thilikos, Dimitrios M.
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Exact sciences and technology fixed parameter algorithms hitting set kernels Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!