Lossy kernels for hitting subgraphs

Eduard Eiben, Danny Hermelin, M. S. Ramanujan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 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 d2-approximate kernel of constant size and 1-approximate kernel of size kO(d2).

Original languageEnglish
Title of host publication42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017
EditorsKim G. Larsen, Jean-Francois Raskin, Hans L. Bodlaender
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770460
DOIs
StatePublished - 1 Nov 2017
Event42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017 - Aalborg, Denmark
Duration: 21 Aug 201725 Aug 2017

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume83
ISSN (Print)1868-8969

Conference

Conference42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017
Country/TerritoryDenmark
CityAalborg
Period21/08/1725/08/17

Keywords

  • Graph theory
  • Lossy kernelization
  • Parameterized algorithms

Fingerprint

Dive into the research topics of 'Lossy kernels for hitting subgraphs'. Together they form a unique fingerprint.

Cite this