Towards optimal and expressive kernelization for \(d\)-hitting set
From MaRDI portal
Publication:486984
DOI10.1007/S00453-013-9774-3zbMATH Open1314.68167arXiv1112.2310OpenAlexW3106541239MaRDI QIDQ486984
Author name not available (Why is that?)
Publication date: 19 January 2015
Published in: (Search for Journal in Brave)
Abstract: d-Hitting Set is the NP-hard problem of selecting at most k vertices of a hypergraph so that each hyperedge, all of which have cardinality at most d, contains at least one selected vertex. The applications of d-Hitting Set are, for example, fault diagnosis, automatic program verification, and the noise-minimizing assignment of frequencies to radio transmitters. We show a linear-time algorithm that transforms an instance of d-Hitting Set into an equivalent instance comprising at most O(k^d) hyperedges and vertices. In terms of parameterized complexity, this is a problem kernel. Our kernelization algorithm is based on speeding up the well-known approach of finding and shrinking sunflowers in hypergraphs, which yields problem kernels with structural properties that we condense into the concept of expressive kernelization. We conduct experiments to show that our kernelization algorithm can kernelize instances with more than 10^7 hyperedges in less than five minutes. Finally, we show that the number of vertices in the problem kernel can be further reduced to O(k^{d-1}) with additional O(k^{1.5 d}) processing time by nontrivially combining the sunflower technique with d-Hitting Set problem kernels due to Abu-Khzam and Moser.
Full work available at URL: https://arxiv.org/abs/1112.2310
No records found.
No records found.
This page was built for publication: Towards optimal and expressive kernelization for \(d\)-hitting set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486984)
