Parameterized Algorithms for d-Hitting Set: the Weighted Case
نویسنده
چکیده
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 previously published running time estimates for the more restricted case of (unweighted) d-Hitting Set. 1
منابع مشابه
Parameterized Algorithms for Hitting Set: The Weighted Case
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 previously published running time estimates for the more restricted case of (unweighted) d-Hitting Set. 1
متن کاملA multivariate framework for weighted FPT algorithms
We present a general framework for solving parameterized problems on weighted graphs. We use this framework to obtain efficient algorithms for such fundamental problems as Vertex Cover, 3-Hitting Set, Edge Dominating Set and k-Internal Out-Branching, on weighted graphs. For each of these problems, given an instance of size n and a weight parameter W ≥ 1, we seek a solution of weight at most (or...
متن کاملParameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints
The 3-Hitting Set problem involves a family of subsets F of size at most three over an universe U . The goal is to find a subset of U of the smallest possible size that intersects every set in F . The version of the problem with parity constraints asks for a subset S of size at most k that, in addition to being a hitting set, also satisfies certain parity constraints on the sizes of the interse...
متن کاملComputing Hitting Set Kernels By AC^0-Circuits
Given a hypergraph H = (V,E), what is the smallest subset X ⊆ V such that e∩X 6= ∅ holds for all e ∈ E? This problem, known as the hitting set problem, is a basic problem in parameterized complexity theory. There are well-known kernelization algorithms for it, which get a hypergraph H and a number k as input and output a hypergraph H ′ such that (1) H has a hitting set of size k if, and only if...
متن کاملA Parameterized Algorithm for Bounded-Degree Vertex Deletion
The d-bounded-degree vertex deletion problem, to delete at most k vertices in a given graph to make the maximum degree of the remaining graph at most d, finds applications in computational biology, social network analysis and some others. It can be regarded as a special case of the (d+2)-hitting set problem and generates the famous vertex cover problem. The d-bounded-degree vertex deletion prob...
متن کامل