3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size

We study upper and lower bounds on the kernel size for the 3-hitting set problem on hypergraphs of degree at most 3, denoted 33-hs. We first show that, unless P=NP, 3-3-hs on 3-uniform hypergraphs

• Type: Journal
• Year: 2011
• Where: TAPAS
• Authors: Iyad A. Kanj, Fenghui Zhang
• Keywords: 3-uniform Hypergraphs, Algorithms, Kernel Size, Lower Bounds, TAPAS 2011