A theory of diagnosis from first principles
Artificial Intelligence
Characterizing diagnoses and systems
Artificial Intelligence
Constrained weighted matchings and edge coverings in graphs
Discrete Applied Mathematics
Vertex cover: further observations and further improvements
Journal of Algorithms
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
Exact algorithms for finding minimum transversals in rank-3 hypergraphs
Journal of Algorithms
Parameterized algorithms for feedback set problems and their duals in tournaments
Theoretical Computer Science - Parameterized and exact computation
Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
ACM Transactions on Algorithms (TALG)
Parameterized algorithmics for linear arrangement problems
Discrete Applied Mathematics
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
Improved exact exponential algorithms for vertex bipartization and other problems
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Comparing trees via crossing minimization
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical 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
Parameterized Complexity
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Theoretical Computer Science
| Hi-index | 5.23 |
We are going to analyze search tree algorithms for Weightedd-Hitting Set. Although the algorithms that we develop are fairly simple, their analysis is technically involved. We compare the weighted case with the previously analyzed unweighted one, exhibiting that the advantage of the unweighted case dwindles with growing d.