A theory of diagnosis from first principles
Artificial Intelligence
Vertex cover might be hard to approximate to within 2-ε
Journal of Computer and System Sciences
Iterative Compression and Exact Algorithms
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Exponential-time approximation of weighted set cover
Information Processing Letters
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set
Algorithmica - Including a Special Section on Genetic and Evolutionary Computation; Guest Editors: Benjamin Doerr, Frank Neumann and Ingo Wegener
Parameterized algorithmics for d-Hitting Set
International Journal of Computer Mathematics
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
On parameterized approximability
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized approximation via fidelity preserving transformations
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We are going to analyze simple search tree algorithms for approximating d-Hitting Set, focussing on the case of factor-2 approximations for d=3. We also derive several results for hypergraph instances of bounded degree, including a new polynomial-time approximation.