An O(20.304n) Algorithm for Solving Maximum Independent Set Problem
IEEE Transactions on Computers
Introduction to algorithms
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
An improved fixed-parameter algorithm for vertex cover
Information Processing Letters
How to find the best approximation results
ACM SIGACT News
Parameterizing above guaranteed values: MaxSat and MaxCut
Journal of Algorithms
Finding maximum independent sets in sparse and general graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A general method to speed up fixed-parameter-tractable algorithms
Information Processing Letters
New upper bounds for maximum satisfiability
Journal of Algorithms
Faster exact algorithms for hard problems: a parameterized point of view
Discrete Mathematics
Some optimal inapproximability results
Journal of the ACM (JACM)
Vertex cover: further observations and further improvements
Journal of Algorithms
Mathematics for the Analysis of Algorithms
Mathematics for the Analysis of Algorithms
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
New Worst-Case Upper Bounds for SAT
Journal of Automated Reasoning
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
Approximating k-Set Cover and Complementary Graph Coloring
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation and Special Cases of Common Subtrees and Editing Distance
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
Average Case Analysis of a Greedy Algorithm for the Minimum Hitting Set Problem
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Upper bounds for vertex cover further improved
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Parameterized Complexity
Call Control with k Rejections
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Minimum Quartet Inconsistency Is Fixed Parameter Tractable
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Parameterized complexity: the main ideas and connections to practical computing
Experimental algorithmics
On efficient fixed-parameter algorithms for weighted vertex cover
Journal of Algorithms
Call control with k rejections
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
A fixed-parameter algorithm for minimum quartet inconsistency
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Exact algorithms for finding minimum transversals in rank-3 hypergraphs
Journal of Algorithms
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
Theoretical Computer Science - Parameterized and exact computation
Parameterized algorithms for feedback set problems and their duals in tournaments
Theoretical Computer Science - Parameterized and exact computation
Consistent query answering in databases
ACM SIGMOD Record
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A bounded search tree algorithm for parameterized face cover
Journal of Discrete Algorithms
Backdoor Sets of Quantified Boolean Formulas
Journal of Automated Reasoning
On problems without polynomial kernels
Journal of Computer and System Sciences
The union of minimal hitting sets: Parameterized combinatorial bounds and counting
Journal of Discrete Algorithms
Fixed-parameter tractability results for feedback set problems in tournaments
Journal of Discrete Algorithms
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Parameterized algorithms for d-Hitting Set: The weighted case
Theoretical Computer Science
A kernelization algorithm for d-Hitting Set
Journal of Computer and System Sciences
A novel branching strategy for parameterized graph modification problems
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
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
Hardness of subgraph and supergraph problems in c-tournaments
Theoretical Computer Science
ICDT'07 Proceedings of the 11th international conference on Database Theory
Improved exact exponential algorithms for vertex bipartization and other problems
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Two-Layer planarization: improving on parameterized algorithmics
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Fixed-parameter tractability results for feedback set problems in tournaments
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Parameterized algorithms for HITTING SET: the weighted case
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Kernels: annotated, proper and induced
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Kernelization algorithms for d-hitting set problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Estimating population size via line graph reconstruction
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Resolving spatial inconsistencies in chromosome conformation data
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Upper and lower bounds for weak backdoor set detection
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Theoretical Computer Science
| Hi-index | 0.00 |
Given a collection C of subsets of size three of a finite set S and a positive integer k, the 3-Hitting Set problem is to determine a subset S' ⊆ S with |S'| ≤ k, so that S' contains at least one element from each subset in C. The problem is NP-complete, and is motivated, for example, by applications in computational biology. Improving previous work, we give an O(2.270k + n) time algorithm for 3-Hitting Set, which is efficient for small values of k, a typical occurrence in some applications. For d-Hitting Set we present an O(ck + n) time algorithm with c = d - 1 + O(d-1).