Computational experience with a SDP-based algorithm for maximum cut with limited unbalance (Q3057151)
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 5818798
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational experience with a SDP-based algorithm for maximum cut with limited unbalance |
scientific article; zbMATH DE number 5818798 |
Statements
Computational experience with a SDP-based algorithm for maximum cut with limited unbalance (English)
0 references
24 November 2010
0 references
network design
0 references
randomized approximation algorithm
0 references
semidefinite programming
0 references
unbalanced maximum cut
0 references
0 references
0 references
0 references
0.91779613
0 references
0.9094101
0 references
0.90565795
0 references
0.88594365
0 references
0.8849544
0 references
0.88379854
0 references
0.88194567
0 references
0.88194567
0 references
0.8817287
0 references
