"Approximation Algorithms for the k-Clique Covering Problem."

Olivier Goldschmidt et al. (1996)

> Home

Details and statistics

DOI: 10.1137/S089548019325232X

access: closed

type: Journal Article

metadata version: 2020-04-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamdm/GoldschmidtHHY96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/GoldschmidtHHY96
Olivier Goldschmidt, Dorit S. Hochbaum, Cor A. J. Hurkens, Gang Yu:
Approximation Algorithms for the k-Clique Covering Problem. SIAM J. Discret. Math. 9(3): 492-509 (1996)

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.