Diverse collections in matroids and graphs.

We investigate the parameterized complexity of finding diverse sets of solutions to three fundamental combinatorial problems. The input to the Weighted Diverse Bases problem consists of a matroid , a weight function , and integers . The task is to decide if there is a collection of of such that the weight of the symmetric difference of any pair of these bases is at least .