A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems (Q1730018)
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 7033884
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems |
scientific article; zbMATH DE number 7033884 |
Statements
A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems (English)
0 references
11 March 2019
0 references
computational complexity
0 references
hardness of approximation
0 references
label cover
0 references
connectivity problems
0 references
0 references
0 references
0.7877112030982971
0 references
0.7822397947311401
0 references
0.7762419581413269
0 references
0.7302350997924805
0 references
0.7226638197898865
0 references
