Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935)
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: Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems |
scientific article; zbMATH DE number 1343338
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems |
scientific article; zbMATH DE number 1343338 |
Statements
Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (English)
0 references
17 February 2000
0 references
polynomial time approximation schemes
0 references
exhaustive sampling
0 references
0 references
0 references
0 references
0.96788734
0 references
0.9214434
0 references
0.9214432
0 references
0.91684484
0 references
0.89839584
0 references
0.89440453
0 references
