"On the complexity of approximating k-set packing."

Elad Hazan, Shmuel Safra, Oded Schwartz (2006)

> Home

Details and statistics

DOI: 10.1007/S00037-006-0205-6

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cc/HazanSS06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cc/HazanSS06
Elad Hazan, Shmuel Safra, Oded Schwartz:
On the complexity of approximating k-set packing. Comput. Complex. 15(1): 20-39 (2006)

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.