Max NP-completeness made easy (Q1960655)
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: Max NP-completeness made easy |
scientific article; zbMATH DE number 1387543
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Max NP-completeness made easy |
scientific article; zbMATH DE number 1387543 |
Statements
Max NP-completeness made easy (English)
0 references
12 January 2000
0 references
approximation algorithms
0 references
approximation preserving reductions
0 references
class Max NP
0 references
probabilistic method
0 references
0.92046344
0 references
0 references
0 references
0 references
0.8570368
0 references
0 references
0.85321623
0 references
0.8518914
0 references
