ON TWO APPROXIMATION ALGORITHMS FOR THE CLIQUE PROBLEM (Q4286115)
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: ON TWO APPROXIMATION ALGORITHMS FOR THE CLIQUE PROBLEM |
scientific article; zbMATH DE number 540226
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | ON TWO APPROXIMATION ALGORITHMS FOR THE CLIQUE PROBLEM |
scientific article; zbMATH DE number 540226 |
Statements
ON TWO APPROXIMATION ALGORITHMS FOR THE CLIQUE PROBLEM (English)
0 references
27 March 1994
0 references
complexity
0 references
greedy algorithms
0 references
\(\mathbb{P}\)-complete
0 references
approximation algorithms
0 references
optimization problem MAX-CLIQUE
0 references
0.8420335054397583
0 references
0.839407205581665
0 references
0.8317286372184753
0 references
0.8304644823074341
0 references
0.8265747427940369
0 references
