Fixed-parameter algorithms for Fair Hitting Set problems

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 U, a family F of subsets of...

Full description

Bibliographic Details

Published in:	Information and computation Vol. 302; p. 105261
Main Authors:	Inamdar, Tanmay, Kanesh, Lawqueen, Kundu, Madhumita, Purohit, Nidhi, Saurabh, Saket
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.01.2025
Subjects:	Fairness Hitting set Parameterized complexity Hitting set Parameterized complexity Fairness
ISSN:	0890-5401
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!