SIAM Journal on Computing
Vertex cover: further observations and further improvements
Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Test-Suite Reduction and Prioritization for Modified Condition/Decision Coverage
IEEE Transactions on Software Engineering
A Parallel Approximation Hitting Set Algorithm for Gene Expression Analysis
SBAC-PAD '02 Proceedings of the 14th Symposium on Computer Architecture and High Performance Computing
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms
Crown Structures for Vertex Cover Kernelization
Theory of Computing Systems
Interference in cellular networks: the minimum membership set cover problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Linear kernels in linear time, or how to save k colors in O(n2) steps
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Kernels: annotated, proper and induced
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Backdoor Sets of Quantified Boolean Formulas
Journal of Automated Reasoning
A Problem Kernelization for Graph Packing
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Incompressibility through Colors and IDs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
The union of minimal hitting sets: Parameterized combinatorial bounds and counting
Journal of Discrete Algorithms
Fixed-parameter algorithms for cluster vertex deletion
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Kernelization for cycle transversal problems
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Preprocessing of min ones problems: a dichotomy
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Solving MINONES-2-SAT as fast as VERTEX COVER
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
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 the hardness and approximation of minimum topic-connected overlay
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Finding k disjoint triangles in an arbitrary graph
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Parameterized approximation via fidelity preserving transformations
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Solving min ones 2-sat as fast as vertex cover
Theoretical Computer Science
| Hi-index | 0.00 |
A kernelization algorithm for the 3-Hitting-Set problem is presented along with a general kernelization for d-Hitting-Set problems. For 3-Hitting-Set, a quadratic kernel is obtained by exploring properties of yes instances and employing what is known as crown reduction. Any 3-Hitting-Set instance is reduced into an equivalent instance that contains at most 5k2 + k elements (or vertices). This kernelization is an improvement over previously known methods that guarantee cubic-size kernels. Our method is used also to obtain a quadratic kernel for the Triangle Vertex Deletion problem. For a constant d ≥ 3, a kernelization of d-Hitting-Set is achieved by a generalization of the 3-Hitting-Set method, and guarantees a kernel whose order does not exceed (2d - 1)kd-1 + k.