On the complexity of approximating the independent set problem (Q5096160): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/BFb0028990 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/BFB0028990 / rank | |||
Normal rank | |||
Latest revision as of 15:54, 30 December 2024
scientific article; zbMATH DE number 7571933
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of approximating the independent set problem |
scientific article; zbMATH DE number 7571933 |
Statements
On the complexity of approximating the independent set problem (English)
0 references
16 August 2022
0 references
feasible solution
0 references
approximation algorithm
0 references
maximization problem
0 references
combinatorial optimization problem
0 references
polynomial-time approximation scheme
0 references
0 references
