Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2017.67
URN: urn:nbn:de:0030-drops-80955
URL: https://drops.dagstuhl.de/opus/volltexte/2017/8095/
Eiben, Eduard ; Hermelin, Danny ; Ramanujan, M. S.
Lossy Kernels for Hitting Subgraphs
| pdf-format: |
|
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 \alpha-approximate kernel for every \alpha>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 d^2-approximate kernel of constant size and 1-approximate kernel of size k^{O(d^2)}.
BibTeX - Entry
@InProceedings{eiben_et_al:LIPIcs:2017:8095,
author = {Eduard Eiben and Danny Hermelin and M. S. Ramanujan},
title = {{Lossy Kernels for Hitting Subgraphs}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {67:1--67:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Kim G. Larsen and Hans L. Bodlaender and Jean-Francois Raskin},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8095},
URN = {urn:nbn:de:0030-drops-80955},
doi = {10.4230/LIPIcs.MFCS.2017.67},
annote = {Keywords: parameterized algorithms, lossy kernelization, graph theory}
}
| Keywords: | parameterized algorithms, lossy kernelization, graph theory | |
| Seminar: | 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) | |
| Issue date: | 2017 | |
| Date of publication: | 01.12.2017 |
