Kernelization Algorithms for d-Hitting Set Problems

DOI10.1007/978-3-540-73951-7_38zbMATH Open1209.68610OpenAlexW1836501071MaRDI QIDQ3603547FDOQ3603547

Publication date: 17 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_38

Recommendations

A kernelization algorithm for \(d\)-hitting set
Parameterized and Exact Computation
Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space
Linear kernelizations for restricted 3-Hitting Set problems
Towards optimal and expressive kernelization for \(d\)-hitting set

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Cited In (30)

Solving min ones 2-SAT as fast as vertex cover
A parameterized algorithm for subset feedback vertex set in tournaments
There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration
An efficient fixed-parameter algorithm for 3-hitting set
Parameterized algorithms for \(d\)-hitting set: the weighted case
Multiple hypernode hitting sets and smallest two-cores with targets
The union of minimal hitting sets: parameterized combinatorial bounds and counting
A top-down approach to search-trees: Improved algorithmics for 3-hitting set
A kernelization algorithm for \(d\)-hitting set
Fixed-parameter algorithms for cluster vertex deletion
Parameterized and Exact Computation
Two edge modification problems without polynomial kernels
Computing Hitting Set Kernels By AC^0-Circuits
Linear kernelizations for restricted 3-Hitting Set problems
Pseudo-kernelization: A branch-then-Reduce approach for FPT problems
Even faster algorithm for set splitting!
A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion
Backdoor sets of quantified Boolean formulas
3-\textsc{hitting set} on bounded degree hypergraphs: upper and lower bounds on the kernel size
Fixed-Parameter Algorithms for Cluster Vertex Deletion
Two edge modification problems without polynomial kernels
Kernelizations for Parameterized Counting Problems
An improved kernelization algorithm for \(r\)-set packing
Towards optimal and expressive kernelization for \(d\)-hitting set
Towards optimal and expressive kernelization for \(d\)-hitting set
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems
A Problem Kernelization for Graph Packing
On generating triangle-free graphs
Fixed-parameter tractability results for feedback set problems in tournaments

This page was built for publication: Kernelization Algorithms for d-Hitting Set Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603547)