On the hardness of approximating Multicut and Sparsest-Cut (Q2458939): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s00037-006-0210-9 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00037-006-0210-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2161719898 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00037-006-0210-9 / rank | |||
Normal rank | |||
Latest revision as of 18:45, 18 December 2024
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
