The greedy method to generate subset D of D is as follows: we iteratively add a problem p from D \ D to D which minimizes the value of f lex (p, D ).
at each step, we add a problem which has the least average pairwise lexical overlap with the problems already in D .