Linear Kernelizations for Restricted 3-Hitting Set Problems

@article{Cai2009LinearKF,
  title={Linear Kernelizations for Restricted 3-Hitting Set Problems},
  author={Xuan Cai},
  journal={Inf. Process. Lett.},
  year={2009},
  volume={109},
  pages={730-738}
}
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. 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 26 references

Chleb́ık and J . Chleb́ıková . Crown Reductions for the Minimum Weighted Vertex Cover Problem

  • Z. Füredi, R. L. Graham
  • Discrete Applied Mathematics
  • 2008

Chleb́ıková. Crown Reductions for the Minimum Weighted Vertex Cover Problem

  • J. M. Chleb́ık
  • Discrete Applied Mathematics,
  • 2008

P

  • F. Kuhn
  • von Rickenbach, R. Wattenhofer, E. Welzl and A…
  • 2005
1 Excerpt

Similar Papers

Loading similar papers…