In this paper, we study the CONNECTED H-HITTING SET and DOMINATING SET problems from the perspective of approximate kernelization, a framework recently introduced by Lokshtanov et al. [STOC 2017]. For the CONNECTED H-HITTING SET problem, we obtain an α-approximate kernel for every α>1 and complement it with a lower bound for the natural weighted version. We then perform a refined analysis of the tradeoff between the approximation factor and kernel size for the DOMINATING SET problem on d-degenerate graphs, and provide an interpolation of approximate kernels between the known 3d-approximate kernel of constant size and 1-approximate kernel of size kO(d2).
- Parameterized complexity
- Vertex deletion problems
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Networks and Communications
- Computational Theory and Mathematics
- Applied Mathematics