Identifying the Minimal Transversals of a Hypergraph and Related Problems
SIAM Journal on Computing
On the complexity of dualization of monotone disjunctive normal forms
Journal of Algorithms
Data mining, hypergraph transversals, and machine learning (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Generating all maximal independent sets of bounded-degree hypergraphs
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
New methods for 3-SAT decision and worst-case analysis
Theoretical Computer Science
Approximating coloring and maximum independent sets in 3-uniform hypergraphs
Journal of Algorithms
Concrete Mathematics: A Foundation for Computer Science
Concrete Mathematics: A Foundation for Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
Theoretical Computer Science - Parameterized and exact computation
A Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation
Fundamenta Informaticae
A bounded search tree algorithm for parameterized face cover
Journal of Discrete Algorithms
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Parameterized algorithms for d-Hitting Set: The weighted case
Theoretical Computer Science
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
Journal of Computer and System Sciences
Improved exact exponential algorithms for vertex bipartization and other problems
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Parameterized algorithms for HITTING SET: the weighted case
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
A faster algorithm for dominating set analyzed by the potential method
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
A Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation
Fundamenta Informaticae
| Hi-index | 0.00 |
We present two algorithms for the problem of finding a minimum transversal in a hypergraph of rank 3, also known as the 3-Hitting Set problem. This problem is a natural extension of the vertex cover problem for ordinary graphs. The first algorithm runs in time O(1.6538n) for a hypergraph with n vertices, and needs polynomial space. The second algorithm uses exponential space and runs in time O(1.6316n).