@inproceedings{35205c26f062438d93d9158de50bf8a8,
title = "Lossy kernels for hitting subgraphs",
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).",
keywords = "Graph theory, Lossy kernelization, Parameterized algorithms",
author = "Eduard Eiben and Danny Hermelin and Ramanujan, {M. S.}",
note = "Publisher Copyright: {\textcopyright} Eduard Eiben, Danny Hermelin, and M. S. Ramanujan; licensed under Creative Commons License CC-BY.; 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017 ; Conference date: 21-08-2017 Through 25-08-2017",
year = "2017",
month = nov,
day = "1",
doi = "10.4230/LIPIcs.MFCS.2017.67",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Larsen, {Kim G.} and Jean-Francois Raskin and Bodlaender, {Hans L.}",
booktitle = "42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017",
address = "Germany",
}