Approximation algorithms for color spanning diameter

Minimum Diameter Color Spanning Set (MDCSS) on a given set of colored points is the problem of selecting one point from each color such that the diameter of the selected points gets minimized. In this paper, we present some approximation algorithms and show some results on approximability of this problem in low and high dimensions.