Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP (Q293222): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2005980753 / rank | |||
Normal rank | |||
Latest revision as of 10:18, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP |
scientific article |
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
