On approximate preprocessing for domination and hitting subgraphs with connected deletion sets

Eduard Eiben, Danny Hermelin, M. S. Ramanujan

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

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

Original languageEnglish
Pages (from-to)158-170
Number of pages13
JournalJournal of Computer and System Sciences
Volume105
DOIs
StatePublished - 1 Nov 2019

Keywords

  • Kernelization
  • Parameterized complexity
  • Vertex deletion problems

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'On approximate preprocessing for domination and hitting subgraphs with connected deletion sets'. Together they form a unique fingerprint.

Cite this