On the complexity of approximating the independent set problem (Q1184733)
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 the complexity of approximating the independent set problem |
scientific article; zbMATH DE number 34932
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of approximating the independent set problem |
scientific article; zbMATH DE number 34932 |
Statements
On the complexity of approximating the independent set problem (English)
0 references
28 June 1992
0 references
It is shown that for some positive constant \(c\) it is not feasible to approximate the independent set (for graphs of \(n\) vertices) within a factor of \(n^ c\), provided maximum 2-satisfiability does not have a randomized polynomial time approximation scheme. Reductions preserving the quality of approximations are also studied and complete problems are exhibited.
0 references
independent set
0 references
0 references
