Linear kernelizations for restricted 3-Hitting Set problems
type: Item
instance of: scholarly article
title: Linear kernelizations for restricted 3-Hitting Set problems
zbMATH Open document ID: 1209.68271
author: Xuan Cai
published in: Information Processing Letters
publication date: 2010-08-20T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5773788
zbMATH Keywords: computational complexity
zbMATH Keywords: 3-Hitting Set problem
zbMATH Keywords: kernelization
MaRDI profile type: Publication
OpenAlex ID: W1985829525
cites work: Kernelization Algorithms for d-Hitting Set Problems
cites work: Polynomial-time data reduction for dominating set
cites work: Q3221758
cites work: On Problems without Polynomial Kernels (Extended Abstract)
cites work: Nondeterminism within $P^ * $
cites work: Improved lower bounds on k‐independence
cites work: Solving large FPT problems on coarse-grained parallel machines
cites work: Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
cites work: On the Fractional Covering Number of Hypergraphs
cites work: Parameterized and Exact Computation
cites work: Q4393480
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Parametrized complexity theory.
cites work: Q3549693
cites work: On the Induced Matching Problem
cites work: Q4180391
cites work: The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
cites work: Parameterized complexity of finding regular induced subgraphs
cites work: Vertex packings: Structural properties and algorithms
cites work: Q5710169
DOI: 10.1016/J.IPL.2009.03.004
description: scientific article; zbMATH DE number 5773788