An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance |
scientific article; zbMATH DE number 6419670
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance |
scientific article; zbMATH DE number 6419670 |
Statements
An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (English)
0 references
26 March 2015
0 references
max hypergraph cut
0 references
limited unbalance
0 references
randomized approximation algorithm
0 references
performance ratio
0 references
semidefinite programming
0 references
relaxation
0 references
combinatorial optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
