Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness (Q557903)
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: Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness |
scientific article; zbMATH DE number 2184101
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness |
scientific article; zbMATH DE number 2184101 |
Statements
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness (English)
0 references
30 June 2005
0 references
Approximation algorithm
0 references
Approximation schema
0 references
Combinatorial optimization
0 references
Completeness
0 references
Complexity
0 references
Reduction
0 references
0 references
0.9537423849105836
0 references
0.8663405179977417
0 references
0.8643769025802612
0 references
0.864169180393219
0 references
