SDP-based bounds for graph partition via extended ADMM (Q2125076)
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 7506813
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | SDP-based bounds for graph partition via extended ADMM |
scientific article; zbMATH DE number 7506813 |
Statements
SDP-based bounds for graph partition via extended ADMM (English)
0 references
12 April 2022
0 references
graph partitioning
0 references
semidefinite programming
0 references
ADMM
0 references
combinatorial optimization
0 references
0 references
0 references
0 references
0 references
0 references
0.89693296
0 references
0.89455813
0 references
0.89049387
0 references
0.8847121
0 references
0.88211346
0 references
0.87285423
0 references
0.8671649
0 references
