Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP (Q293222)
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: Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP |
scientific article; zbMATH DE number 6590681
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP |
scientific article; zbMATH DE number 6590681 |
Statements
Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP (English)
0 references
9 June 2016
0 references
computational complexity
0 references
approximation
0 references
maximum independent set problem
0 references
0 references
0.8303139805793762
0 references
0.8028287887573242
0 references
0.7868607640266418
0 references
0.7863020300865173
0 references
