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...

Celý popis

Podrobná bibliografia

Vydané v:	Information and computation Ročník 302; s. 105261
Hlavní autori:	Inamdar, Tanmay, Kanesh, Lawqueen, Kundu, Madhumita, Purohit, Nidhi, Saurabh, Saket
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.01.2025
Predmet:	Fairness Hitting set Parameterized complexity Hitting set Parameterized complexity Fairness
ISSN:	0890-5401
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!