Max NP-completeness made easy (Q1960655): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:36, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Max NP-completeness made easy |
scientific article |
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
