Linear kernelizations for restricted 3-Hitting Set problems

Authors:
Xuan Cai
Affiliations:
BASICS Laboratory, Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China
Venue:
Information Processing Letters
Year:
2009

Citing 15
Cited 1

On the fractional covering number of hypergraphs

SIAM Journal on Discrete Mathematics
Improved lower bounds on k-independence

Journal of Graph Theory
Nondeterminism within P

SIAM Journal on Computing
Test-Suite Reduction and Prioritization for Modified Condition/Decision Coverage

IEEE Transactions on Software Engineering
A Parallel Approximation Hitting Set Algorithm for Gene Expression Analysis

SBAC-PAD '02 Proceedings of the 14th Symposium on Computer Architecture and High Performance Computing
Solving large FPT problems on coarse-grained parallel machines

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Polynomial-time data reduction for dominating set

Journal of the ACM (JACM)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size

SIAM Journal on Computing
Infeasibility of instance compression and succinct PCPs for NP

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On Problems without Polynomial Kernels (Extended Abstract)

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Parameterized complexity of finding regular induced subgraphs

Journal of Discrete Algorithms
The parameterized complexity of the induced matching problem in planar graphs

FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Interference in cellular networks: the minimum membership set cover problem

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Parameterized Complexity

Parameterized Complexity

3-Hitting set on bounded degree hypergraphs: upper and lower bounds on the kernel size

TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we study the 3-Hitting Set problem, also called the Vertex Cover problem on 3-uniform hypergraphs. We provide linear kernelizations for this problem and its dual problem in three types of 3-uniform hypergraphs. Moreover, we obtain lower bounds on the kernel size for them by the parametric duality technique.