Approximation algorithms and hardness results for the clique packing problem (Q5900079)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation algorithms and hardness results for the clique packing problem |
scientific article; zbMATH DE number 5284939
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms and hardness results for the clique packing problem |
scientific article; zbMATH DE number 5284939 |
Statements
Approximation algorithms and hardness results for the clique packing problem (English)
0 references
5 June 2008
0 references
approximation algorithms
0 references
APX-hardness
0 references
clique
0 references
packing
0 references
triangle
0 references
0.9960911870002748
0 references
0.8356812000274658
0 references
0.8353894352912903
0 references
0.8155473470687866
0 references
0.8056972622871399
0 references
