An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q593062 |
Changed an Item |
||
Property / author | |||
Property / author: Bao-Gang Xu / rank | |||
Normal rank |
Revision as of 03:28, 20 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance |
scientific article |
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