Abstract
In this project, we tackle covering problems considering concepts of fairness. Given a universe set U, a family of subsets S, and a coloring function C of the elements from U, we say that a cover (X in S) is fair if the number of covered elements is equally divided between the color classes. Given also a weight function for the elements of U and an integer k, we define the problem of Fair…