A top-down approach to search-trees: Improved algorithmics for 3-hitting set
From MaRDI portal
Publication:848640
DOI10.1007/S00453-008-9199-6zbMATH Open1184.68598OpenAlexW1977376294MaRDI QIDQ848640FDOQ848640
Authors: Henning Fernau 
Publication date: 4 March 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9199-6
Recommendations
Cites Work
- Automated generation of search tree algorithms for hard graphs modification problems
- Kernels: Annotated, Proper and Induced
- A top-down approach to search-trees: Improved algorithmics for 3-hitting set
- Automata, Languages and Programming
- A theory of diagnosis from first principles
- Title not available (Why is that?)
- Improved Parameterized Upper Bounds for Vertex Cover
- Vertex cover: Further observations and further improvements
- New methods for 3-SAT decision and worst-case analysis
- Call control with \(k\) rejections
- Two-Layer Planarization: Improving on Parameterized Algorithmics
- Kernelization Algorithms for d-Hitting Set Problems
- Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems
- An efficient fixed-parameter algorithm for 3-hitting set
- A refined search tree technique for dominating set on planar graphs
- A new multilayered {PCP} and the hardness of hypergraph vertex cover
- Exact algorithms for finding minimum transversals in rank-3 hypergraphs
- Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
- Parameterized Algorithms for Hitting Set: The Weighted Case
- Faster exact algorithms for hard problems: A parameterized point of view
- Title not available (Why is that?)
- Combinatorial Pattern Matching
- The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting
Cited In (22)
- Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
- A fast branching algorithm for cluster vertex deletion
- Dynamic kernels for hitting sets and set packing
- Speeding up Exact Algorithms With High Probability
- Parameterized Algorithms for Hitting Set: The Weighted Case
- Strong Backdoors for Default Logic
- 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
- A Parameterized Algorithm for Bounded-Degree Vertex Deletion
- Kernelization for cycle transversal problems
- 3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size
- Pseudo-kernelization: A branch-then-Reduce approach for FPT problems
- A bounded search tree algorithm for parameterized face cover
- Backdoors to satisfaction
- Faster parameterized algorithm for cluster vertex deletion
- Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
- Parameterizations of hitting set of bundles and inverse scope
- Tournaments and Semicomplete Digraphs
- Parameterized approximation algorithms for hitting set
- Fixed-parameter tractability results for feedback set problems in tournaments
- A multivariate framework for weighted FPT algorithms
This page was built for publication: A top-down approach to search-trees: Improved algorithmics for 3-hitting set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848640)
