A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems (Q1730018): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:43, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems |
scientific article |
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
