Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints

Abstract

The $3$ -Hitting Set problem involves a family of subsets ${\mathcal F}$ of size at most three over an universe ${\mathcal U}$. The goal is to find a subset of ${\mathcal U}$ of the smallest possible size that intersects every set in ${\mathcal F}$. The version of the problem with parity constraints asks for a subset $S$ of size at most $k$ that, in addition to being a hitting set, also satisfies certain parity constraints on the sizes of the intersections of $S$ with each set in the family ${\mathcal F}$. In particular, an odd (even) set is a hitting set that hits every set at either one or three (two) elements, and a perfect code is a hitting set that intersects every set at exactly one element. These questions are of fundamental interest in many contexts for general set systems. Just as for Hitting Set, we find these questions to be interesting for the case of families consisting of sets of size at most three. In this work, we initiate an algorithmic study of these problems in this special case, focusing on a parameterized analysis. We show, for each problem, efficient fixed-parameter tractable algorithms using search trees that are tailor-made to the constraints in question, and also polynomial kernels using sunflower-like arguments in a manner that accounts for equivalence under the additional parity constraints.

V. Kamat—Supported by a postdoctoral fellowship from the Warsaw Center of Mathematics and Computer Science

N. Misra—Supported by the INSPIRE Faculty Scheme, DST India (project DSTO-1209).