LIPIcs.MFCS.2023.55.pdf
- Filesize: 0.81 MB
- 14 pages
Document
Fixed-Parameter Algorithms for Fair Hitting Set Problems
Authors
Tanmay Inamdar 
,
-
Part of:
Volume:
48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Mathematical Foundations of Computer Science (MFCS) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2023-08-21
File
Document Identifiers
Author Details
Cite As Get BibTex
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, and Saket Saurabh. Fixed-Parameter Algorithms for Fair Hitting Set Problems. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 55:1-55:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.MFCS.2023.55
Abstract
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.
Subject Classification
ACM Subject Classification
- Theory of computation → Fixed parameter tractability
Keywords
- Fairness
- Parameterized Algorithms
- Hitting Set
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, and Anna Zych-Pawlewicz. On sparse hitting sets: from fair vertex cover to highway dimension. CoRR, abs/2208.14132, 2022. URL: https://doi.org/10.48550/arXiv.2208.14132.
- Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2015. URL: https://doi.org/10.1007/978-3-319-21275-3.
-
Reinhard Diestel. Graph Theory, 4th Edition, volume 173 of Graduate texts in mathematics. Springer, 2012.
- Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, and Saket Saurabh. Efficient computation of representative families with applications in parameterized and exact algorithms. J. ACM, 63(4):29:1-29:60, 2016. URL: https://doi.org/10.1145/2886094.
- Pallavi Jain, Lawqueen Kanesh, and Pranabendu Misra. Conflict free version of covering problems on graphs: Classical and parameterized. Theory Comput. Syst., 64(6):1067-1093, 2020. URL: https://doi.org/10.1007/s00224-019-09964-6.
-
Richard M Karp. Reducibility among combinatorial problems. In Complexity of computer computations, pages 85-103. Springer, 1972.
- Dusan Knop, Tomás Masarík, and Tomás Toufar. Parameterized complexity of fair vertex evaluation problems. In Peter Rossmanith, Pinar Heggernes, and Joost-Pieter Katoen, editors, 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany, volume 138 of LIPIcs, pages 33:1-33:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPIcs.MFCS.2019.33.
- Li-Shin Lin and Sartaj Sahni. Fair edge deletion problems. IEEE Trans. Computers, 38(5):756-761, 1989. URL: https://doi.org/10.1109/12.24280.
- Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, and Saket Saurabh. Deterministic truncation of linear matroids. ACM Trans. Algorithms, 14(2):14:1-14:20, 2018. URL: https://doi.org/10.1145/3170444.
- Dániel Marx. A parameterized view on matroid optimization problems. Theor. Comput. Sci., 410(44):4471-4479, 2009. URL: https://doi.org/10.1016/j.tcs.2009.07.027.
- Tomás Masarík and Tomás Toufar. Parameterized complexity of fair deletion problems. Discret. Appl. Math., 278:51-61, 2020. URL: https://doi.org/10.1016/j.dam.2019.06.001.