Kernelization Algorithms for d-Hitting Set Problems
From MaRDI portal
Publication:3603547
DOI10.1007/978-3-540-73951-7_38zbMath1209.68610OpenAlexW1836501071MaRDI QIDQ3603547
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
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
A top-down approach to search-trees: Improved algorithmics for 3-hitting set, A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion, Two edge modification problems without polynomial kernels, Solving min ones 2-SAT as fast as vertex cover, A parameterized algorithm for subset feedback vertex set in tournaments, Fixed-parameter tractability results for feedback set problems in tournaments, A Problem Kernelization for Graph Packing, Fixed-parameter algorithms for cluster vertex deletion, Linear kernelizations for restricted 3-Hitting Set problems, Fixed-Parameter Algorithms for Cluster Vertex Deletion, An improved kernelization algorithm for \(r\)-set packing, On Generating Triangle-Free Graphs, Two Edge Modification Problems without Polynomial Kernels, Backdoor sets of quantified Boolean formulas, The union of minimal hitting sets: parameterized combinatorial bounds and counting, There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration
