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 this page instead for the normal view: Inapproximability of Combinatorial Problems via Small LPs and SDPs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inapproximability of Combinatorial Problems via Small LPs and SDPs |
scientific article |
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
