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

v1

Type:Preprint

0 views

[![NobleID](https://www.nobleid.org/api/badge/DF47BBE7.svg?ark=w1%2F20260515%2FDF47BBE7)](https://nobleid.org/work/w1/20260515/DF47BBE7)

ARK Inflections

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors