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

14 years 1 months ago

Download facweb.cs.depaul.edu

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 ﬁrst show that, unless P=NP, 3-3-hs on 3-uniform hypergraphs

Iyad A. Kanj, Fenghui Zhang

Real-time Traffic

3-uniform Hypergraphs | Algorithms | Kernel Size | Lower Bounds | TAPAS 2011 |

claim paper

» Kernelization of packing problems

» Learning a Hidden Hypergraph

» A New Algorithm for Finding Minimal CycleBreaking Sets of Turns in a Graph

» Disproof of the Neighborhood Conjecture with Implications to SAT

» Discrepancy and the Power of Bottom Fanin in Depththree Circuits

» Satisfiability Allows No Nontrivial Sparsification Unless The PolynomialTime Hierarchy Col...

» Fast Periodic Graph Exploration with Constant Memory

» A new perspective on implementation by voting trees

Post Info
More Details (n/a)

Added	15 May 2011
Updated	15 May 2011
Type	Journal
Year	2011
Where	TAPAS
Authors	Iyad A. Kanj, Fenghui Zhang

Comments (0)

Sciweavers

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

3-uniform Hypergraphs | Algorithms | Kernel Size | Lower Bounds | TAPAS 2011 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers