{"paper":{"title":"Greedy is good: An experimental study on minimum clique cover and maximum independent set problems for randomly generated rectangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Anirban Ghosh, Ritankar Mandal, Sasanka Roy, Subhas C. Nandy","submitted_at":"2012-12-04T08:50:27Z","abstract_excerpt":"Given a set ${\\cal 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 independent set (MIS) for the intersection graph $G({\\cal R})$ of the members in $\\cal R$ are both computationally hard \\cite{CC05}. For the MCC problem, it is proved that polynomial time constant factor approximation is impossible to obtain \\cite{PT11}. Though such a result is not proved yet for the MIS problem, no polynomial time constant factor approximation algorithm exists in the literature. We study the performance of g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0640","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}