A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis (Q6064054)
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 7762783
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis |
scientific article; zbMATH DE number 7762783 |
Statements
A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis (English)
0 references
8 November 2023
0 references
randomized algorithm
0 references
approximation algorithm
0 references
complex semidefinite programming
0 references
max hypergraph 3-cut
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8646436929702759
0 references
0.8087168335914612
0 references
0.8031183481216431
0 references
