On the hardness of approximating the \(k\)-\textsc{Way Hypergraph Cut} problem (Q5140849)
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 7286924
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the hardness of approximating the \(k\)-\textsc{Way Hypergraph Cut} problem |
scientific article; zbMATH DE number 7286924 |
Statements
17 December 2020
0 references
hardness of approximation
0 references
\(k\)-way hypergraph cut
0 references
0 references
0.7828846573829651
0 references
0.7818933725357056
0 references
0.7721952199935913
0 references
