"Greedy is good: An experimental study on minimum clique cover and maximum ..."

Ritankar Mandal et al. (2012)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2021-11-22

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-1212-0640
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1212-0640
Ritankar Mandal, Anirban Ghosh, Sasanka Roy, Subhas C. Nandy:
Greedy is good: An experimental study on minimum clique cover and maximum independent set problems for randomly generated rectangles. CoRR abs/1212.0640 (2012)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.