License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.IPEC.2018.14
URN: urn:nbn:de:0030-drops-102158
URL: https://drops.dagstuhl.de/opus/volltexte/2019/10215/
Go to the corresponding LIPIcs Volume Portal


Agrawal, Akanksha ; Jain, Pallavi ; Kanesh, Lawqueen ; Misra, Pranabendu ; Saurabh, Saket

Exploring the Kernelization Borders for Hitting Cycles

pdf-format:
LIPIcs-IPEC-2018-14.pdf (0.6 MB)


Abstract

A generalization of classical cycle hitting problems, called conflict version of the problem, is defined as follows. An input is undirected graphs G and H on the same vertex set, and a positive integer k, and the objective is to decide whether there exists a vertex subset X subseteq V(G) such that it intersects all desired "cycles" (all cycles or all odd cycles or all even cycles) and X is an independent set in H. In this paper we study the conflict version of classical Feedback Vertex Set, and Odd Cycle Transversal problems, from the view point of kernelization complexity. In particular, we obtain the following results, when the conflict graph H belongs to the family of d-degenerate graphs. 1) CF-FVS admits a O(k^{O(d)}) kernel. 2) CF-OCT does not admit polynomial kernel (even when H is 1-degenerate), unless NP subseteq coNP/poly. For our kernelization algorithm we exploit ideas developed for designing polynomial kernels for the classical Feedback Vertex Set problem, as well as, devise new reduction rules that exploit degeneracy crucially. Our main conceptual contribution here is the notion of "k-independence preserver". Informally, it is a set of "important" vertices for a given subset X subseteq V(H), that is enough to capture the independent set property in H. We show that for d-degenerate graph independence preserver of size k^{O(d)} exists, and can be used in designing polynomial kernel.

BibTeX - Entry

@InProceedings{agrawal_et_al:LIPIcs:2019:10215,
  author =	{Akanksha Agrawal and Pallavi Jain and Lawqueen Kanesh and Pranabendu Misra and Saket Saurabh},
  title =	{{Exploring the Kernelization Borders for Hitting Cycles}},
  booktitle =	{13th International Symposium on Parameterized and Exact  Computation (IPEC 2018)},
  pages =	{14:1--14:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-084-2},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{115},
  editor =	{Christophe Paul and Michal Pilipczuk},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10215},
  URN =		{urn:nbn:de:0030-drops-102158},
  doi =		{10.4230/LIPIcs.IPEC.2018.14},
  annote =	{Keywords: Parameterized Complexity, Kernelization, Conflict-free problems, Feedback Vertex Set, Even Cycle Transversal, Odd Cycle Transversal}
}

Keywords: Parameterized Complexity, Kernelization, Conflict-free problems, Feedback Vertex Set, Even Cycle Transversal, Odd Cycle Transversal
Seminar: 13th International Symposium on Parameterized and Exact Computation (IPEC 2018)
Issue Date: 2019
Date of publication: 25.01.2019


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI