Sciweavers

Share
TAPAS
2011

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

10 years 6 months ago
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
Iyad A. Kanj, Fenghui Zhang
Added 15 May 2011
Updated 15 May 2011
Type Journal
Year 2011
Where TAPAS
Authors Iyad A. Kanj, Fenghui Zhang
Comments (0)
books