A theory of diagnosis from first principles
Artificial Intelligence
Characterizing diagnoses and systems
Artificial Intelligence
Vertex cover: further observations and further improvements
Journal of Algorithms
A Fixed-Parameter Approach to Two-Layer Planarization
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
On efficient fixed-parameter algorithms for weighted vertex cover
Journal of Algorithms
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms
Quasiconvex analysis of backtracking algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Exact algorithms for finding minimum transversals in rank-3 hypergraphs
Journal of Algorithms
Parameterized algorithmics for linear arrangement problems
Discrete Applied Mathematics
Improved exact exponential algorithms for vertex bipartization and other problems
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Measure and conquer: domination – a case study
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Comparing trees via crossing minimization
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Parameterized Complexity
Improved FPT algorithm for feedback vertex set problem in bipartite tournament
Information Processing Letters
Iterative Compression and Exact Algorithms
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
The union of minimal hitting sets: Parameterized combinatorial bounds and counting
Journal of Discrete Algorithms
Iterative compression and exact algorithms
Theoretical Computer Science
Parameterized algorithms for d-Hitting Set: The weighted case
Theoretical Computer Science
The union of minimal hitting sets: parameterized combinatorial bounds and counting
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Exact algorithms for maximum acyclic subgraph on a superclass of cubic graphs
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Fixed-parameter algorithms for cluster vertex deletion
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
| Hi-index | 0.00 |
We are going to analyze simple search tree algorithms for Weighted d-Hitting Set. Although the algorithms are simple, their analysis is technically rather involved. However, this approach allows us to even improve on elsewhere published algorithm running time estimates for the more restricted case of (unweighted) d-Hitting Set.