On the NP-hardness of approximating ordering-constraint satisfaction problems (Q2941635)
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 6474895
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the NP-hardness of approximating ordering-constraint satisfaction problems |
scientific article; zbMATH DE number 6474895 |
Statements
21 August 2015
0 references
acyclic subgraph
0 references
approximation resistance
0 references
betweenness
0 references
constraint satisfaction
0 references
CSPs
0 references
feedback arc set
0 references
hypercontractivity
0 references
NP-completeness
0 references
orderings
0 references
PCP
0 references
probabilistically checkable proofs
0 references
0.973007082939148
0 references
0.8897005319595337
0 references
0.8070339560508728
0 references
0.7874768972396851
0 references
0.7816461324691772
0 references
