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