On the hardness of approximating Multicut and Sparsest-Cut (Q2458939): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal 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 | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:06, 20 March 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
