Given a set of $n$ configurations $C_1 , C_2 ... C_n$ and a function $f$ such that $f(C_i)$ produces a set of $m$ results $R_1, R_2 ... R_m$ where $R_j=\{0,1\}$We only care about the $\Sigma f(C_i)$ - i.e. $Rj = 1$ if any $f(C_i)$ has $R_j = 1$What is an efficient algorithm to find a subset of $C$ of size $s$ such that a maximum number of $R_j = 1$ are found?A secondary problem is to have the subset sorted such that new $R_j = 1$ are found first. i.e  $f(C_{i+1})$ will find $\leq$ new $R_j = 1$ than $f(C_i)$
Find subset of configurations which produces maximum result
ds.algorithms