We address two variations of the maximum diversity problem which arise
s when m elements are to be selected from an n-element population base
d on inter-element distances. We study problem complexity and propose
randomized greedy heuristics. Performance of the heuristics is tested
on a limited basis.