Inapproximability of combinatorial problems via small LPs and SDPs (Q2941494)
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 6474712
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inapproximability of combinatorial problems via small LPs and SDPs |
scientific article; zbMATH DE number 6474712 |
Statements
Inapproximability of Combinatorial Problems via Small LPs and SDPs (English)
0 references
21 August 2015
0 references
extended formulations
0 references
polyhedral approximation
0 references
restrictions
0 references
stable sets
0 references
0 references
0.8851390480995178
0 references
0.8502159118652344
0 references
0.810880720615387
0 references
0.8105687499046326
0 references
0.8084113001823425
0 references
