Smaller kernels for hitting set problems of constant arity

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/97932

Title:	Smaller kernels for hitting set problems of constant arity
Author:	Nishimura, Naomi; Ragde, Prabhakar; Thilikos Touloupas, Dimitrios
Other authors:	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
Abstract:	We demonstrate a kernel of size O(k^2) for 3-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(k^3) kernel of Niedermeier and Rossmanith. Our technique uses the Nemhauser-Trotter linear-size kernel for vc, and generalizes to demonstrating a kernel of size O(k^{r-1}) for r- HITTING SET (for fixed r).
Subject(s):	-Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica -Kernel -Hitting set -Constant arity
Rights:
Document type:	Article - Published version Report
Share: