Let S be a point set in the plane such that each of its elements is colored either red or blue. A matching of S with rectangles is any set of pairwise-disjoint axis-aligned closed rectangles such that each rectangle contains exactly two points of S. Such a matching is monochromatic if every rectangle contains points of the same color, and is bichromatic if every rectangle contains points of different colors. We study the following two problems: (1) Find a maximum monochromatic matching of S with rectangles. (2) Find a maximum bichromatic matching of S with rectangles. For each problem we provide a polynomial-time approximation algorithm that constructs a matching with at least 1 / 4 of the number of rectangles of an optimal matching. We show that the first problem is -hard even if either the matching rectangles are restricted to axis-aligned segments or S is in general position, that is, no two points of S share the same x or y coordinate. We further show that the second problem is also -hard, even if S is in general position. These -hardness results follow by showing that deciding the existence of a matching that covers all points is -complete in each case. Additionally, we prove that it is -complete to decide the existence of a matching with rectangles that cover all points in the case where all the points have the same color, solving an open problem of Bereg et al
