FPT Algorithms for Diverse Collections of Hitting Sets

by   Julien Baste, et al.

In this work, we study the d-Hitting Set and Feedback Vertex Set problems through the paradigm of finding diverse collections of r solutions of size at most k each, which has recently been introduced to the field of parameterized complexity [Baste et al., 2019]. This paradigm is aimed at addressing the loss of important side information which typically occurs during the abstraction process which models real-world problems as computational problems. We use two measures for the diversity of such a collection: the sum of all pairwise Hamming distances, and the minimum pairwise Hamming distance. We show that both problems are FPT in k + r for both diversity measures. A key ingredient in our algorithms is a (problem independent) network flow formulation that, given a set of `base' solutions, computes a maximally diverse collection of solutions. We believe that this could be of independent interest.


page 1

page 2

page 3

page 4


Finding Diverse Trees, Paths, and More

Mathematical modeling is a standard approach to solve many real-world pr...

Finding Diverse Minimum s-t Cuts

Recently, many studies have been devoted to finding diverse solutions in...

Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study

Finding diverse solutions in combinatorial problems recently has receive...

Parameterized Algorithms for Diverse Multistage Problems

The world is rarely static – many problems need not only be solved once ...

Diverse Collections in Matroids and Graphs

We investigate the parameterized complexity of finding diverse sets of s...

Obtaining Approximately Optimal and Diverse Solutions via Dispersion

There has been a long-standing interest in computing diverse solutions t...

Determinantal Sieving

We introduce determinantal sieving, a new, remarkably powerful tool in t...

Please sign up or login with your details

Forgot password? Click here to reset