Polynomial flow-cut gaps and hardness of directed cut problems (Q3452200)
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 6507184
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial flow-cut gaps and hardness of directed cut problems |
scientific article; zbMATH DE number 6507184 |
Statements
Polynomial flow-cut gaps and hardness of directed cut problems (English)
0 references
11 November 2015
0 references
directed multicut
0 references
hardness of approximation
0 references
sparsest cut
0 references
0.9174296855926514
0 references
0.8520398736000061
0 references
0.8343176245689392
0 references
0.8235545754432678
0 references
0.8226238489151001
0 references
