Hardness and inapproximability of convex recoloring problems (Q2446103)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6285602
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness and inapproximability of convex recoloring problems |
scientific article; zbMATH DE number 6285602 |
Statements
Hardness and inapproximability of convex recoloring problems (English)
0 references
16 April 2014
0 references
convex recoloring
0 references
complexity
0 references
inapproximability
0 references
linear-time algorithm
0 references
grid graph
0 references
\((q,q-4)\)-graph
0 references
0.9799991846084596
0 references
0.90753173828125
0 references
0.905749499797821
0 references
0.9051227569580078
0 references
0.9028194546699524
0 references
