FPT Algorithms for Diverse Collections of Hitting Sets
نویسندگان
چکیده
منابع مشابه
Dissimilarity-Based Algorithms for Selecting Structurally Diverse Sets of Compounds
This paper commences with a brief introduction to modern techniques for the computational analysis of molecular diversity and the design of combinatorial libraries. It then reviews dissimilarity-based algorithms for the selection of structurally diverse sets of compounds in chemical databases. Procedures are described for selecting a diverse subset of an entire database, and for selecting diver...
متن کاملFast FPT-Algorithms for Cleaning Grids
We consider the problem that, given a graph G and a parameter k, asks whether the edit distance of G and a rectangular grid is at most k. We examine the general case where the edit operation are vertex/edge removals and additions. If the dimensions of the grid are given in advance, then we give a parameterized algorithm that runs in 2 k·k) +O(n) steps. In the case where the dimensions of the gr...
متن کاملFPT Algorithms for Connected Feedback Vertex Set
We study the recently introduced Connected Feedback Vertex Set (CFVS) problem from the view-point of parameterized algorithms. CFVS is the connected variant of the classical Feedback Vertex Set problem and is defined as follows: given a graph G = (V, E) and an integer k, decide whether there exists F ⊆ V , |F | ≤ k, such that G[V \ F ] is a forest and G[F ] is connected. We show that Connected ...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2019
ISSN: 1999-4893
DOI: 10.3390/a12120254