On the complexity of approximating \(k\)-set packing (Q2506163): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57310535, #quickstatements; #temporary_batch_1707232231678 |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Shmuel Safra / rank | |||
| Property / author | |||
| Property / author: Shmuel Safra / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00037-006-0205-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966923282 / rank | |||
Normal rank | |||
Latest revision as of 01:06, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of approximating \(k\)-set packing |
scientific article |
Statements
On the complexity of approximating \(k\)-set packing (English)
0 references
28 September 2006
0 references
computational complexity
0 references
hardness of approximation
0 references
set packing
0 references
