On the hardness of approximating Multicut and Sparsest-Cut (Q2458939)
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: On the hardness of approximating Multicut and Sparsest-Cut |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the hardness of approximating Multicut and Sparsest-Cut |
scientific article |
Statements
On the hardness of approximating Multicut and Sparsest-Cut (English)
0 references
5 November 2007
0 references
multicut
0 references
sparsest-cut
0 references
unique games conjecture
0 references
Fourier analysis
0 references
