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 |
Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2963791077 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1807.00936 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 22:25, 18 April 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