We thus propose to augment the robust covering problem with fairness constraints.
we propose to achieve max-min fairness by imposing fairness constraints on each group's coverage: we require that at least a fraction W of nodes from each group be covered.