ETH-hardness of approximating 2-CSPs and directed Steiner network (Q4993301)
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: ETH-hardness of approximating 2-CSPs and directed Steiner network |
scientific article; zbMATH DE number 7359373
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | ETH-hardness of approximating 2-CSPs and directed Steiner network |
scientific article; zbMATH DE number 7359373 |
Statements
15 June 2021
0 references
hardness of approximation
0 references
constraint satisfaction problems
0 references
directed Steiner network
0 references
parameterized complexity
0 references
0 references
0 references
ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network (English)
0 references
0.7701546549797058
0 references
0.76894211769104
0 references
0.7657551765441895
0 references
0.7613750100135803
0 references