Greedy is good: An experimental study on minimum clique cover and maximum independent set problems for randomly generated rectangles

Ritankar Mandal, Anirban Ghosh, Sasanka Roy +1

Given a set $\mathcal{R}=\{R_1,R_2,...,R_n\}$ of $n$ randomly positioned axis parallel rectangles in 2D, the problem of computing the minimum clique cover (MCC) and maximum independe…