1 paper
Siddharth Barman, Anand Krishna, Y. Narahari +1
We study coverage problems in which, for a set of agents and a given threshold T, the goal is to select T subsets (of the agents) that, while satisfying combinatorial constrain…