Fixed-Parameter Algorithms for Fair Hitting Set Problems

by   Tanmay Inamdar, et al.

Selection of a group of representatives satisfying certain fairness constraints, is a commonly occurring scenario. Motivated by this, we initiate a systematic algorithmic study of a fair version of Hitting Set. In the classical Hitting Set problem, the input is a universe 𝒰, a family β„± of subsets of 𝒰, and a non-negative integer k. The goal is to determine whether there exists a subset S βŠ†π’° of size k that hits (i.e., intersects) every set in β„±. Inspired by several recent works, we formulate a fair version of this problem, as follows. The input additionally contains a family ℬ of subsets of 𝒰, where each subset in ℬ can be thought of as the group of elements of the same type. We want to find a set S βŠ†π’° of size k that (i) hits all sets of β„±, and (ii) does not contain too many elements of each type. We call this problem Fair Hitting Set, and chart out its tractability boundary from both classical as well as multivariate perspective. Our results use a multitude of techniques from parameterized complexity including classical to advanced tools, such as, methods of representative sets for matroids, FO model checking, and a generalization of best known kernels for Hitting Set.


page 1

page 2

page 3

page 4

βˆ™ 09/10/2022

An EPTAS for Budgeted Matroid Independent Set

We consider the budgeted matroid independent set problem. The input is a...
βˆ™ 12/30/2020

The maximum sum of sizes of cross-intersecting families of subsets of a set

A set of sets is called a family. Two families π’œ and ℬ of sets are said ...
βˆ™ 07/01/2023

On Finding Constrained Independent Sets in Cycles

A subset of [n] = {1,2,…,n} is called stable if it forms an independent ...
βˆ™ 06/03/2022

ErdΕ‘s Matching Conjecture for almost perfect matchings

In 1965 ErdΕ‘s asked, what is the largest size of a family of k-elements ...
βˆ™ 03/19/2018

Parameterized Complexity of Fair Vertex Evaluation Problems

A prototypical graph problem is centered around a graph theoretic proper...
βˆ™ 06/02/2023

Coding information into all infinite subsets of a dense set

Suppose you have an uncomputable set X and you want to find a set A, all...
βˆ™ 06/14/2022

The Complexity of Finding Fair Many-to-One Matchings

We analyze the (parameterized) computational complexity of "fair" varian...

Please sign up or login with your details

Forgot password? Click here to reset