Linear Kernelizations for Restricted 3-Hitting Set Problems
Abstract
The 3-Hitting Set problem is also called the Vertex Cover problem on 3-uniform hypergraphs. In this paper, we address kernelizations of the Vertex Cover problem on 3-uniform hypergraphs. We show that this problem admits a linear kernel in three classes of 3-uniform hypergraphs. We also obtain lower and upper bounds on the kernel size for them by the parametric duality.
0