Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions (Q334238)
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: Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions |
scientific article; zbMATH DE number 6646033
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions |
scientific article; zbMATH DE number 6646033 |
Statements
Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions (English)
0 references
1 November 2016
0 references
multiple reoptimization
0 references
gap-introducing reduction
0 references
gap-preserving reduction
0 references
APX-hardness
0 references
polynomial-time approximation scheme (PTAS)
0 references
0 references
0.794468343257904
0 references
0.7466832995414734
0 references
0.7451039552688599
0 references
0.7423583269119263
0 references
0.7415088415145874
0 references
