Linear Kernelizations for Restricted 3-Hitting Set Problems
Computational Complexity
2008-09-20 v4
Abstract
The 3-\textsc{Hitting Set} problem is also called the \textsc{Vertex Cover} problem on 3-uniform hypergraphs. In this paper, we address kernelizations of the \textsc{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.
Cite
@article{arxiv.0809.0257,
title = {Linear Kernelizations for Restricted 3-Hitting Set Problems},
author = {Xuan Cai},
journal= {arXiv preprint arXiv:0809.0257},
year = {2008}
}
Comments
12 pages