Complexity and approximability of parameterized MAX-CSPs (Q2408203)
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 6788878
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity and approximability of parameterized MAX-CSPs |
scientific article; zbMATH DE number 6788878 |
Statements
Complexity and approximability of parameterized MAX-CSPs (English)
0 references
10 October 2017
0 references
constraint satisfaction problems
0 references
parameterized complexity
0 references
approximation
0 references
clique width
0 references
neighborhood diversity
0 references
0 references
0 references
0 references
0.994846522808075
0 references
0.8229018449783325
0 references
0.812037467956543
0 references
0.8093174695968628
0 references
