Exploiting sparsity for the min \(k\)-partition problem (Q2175445)
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 7194825
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exploiting sparsity for the min \(k\)-partition problem |
scientific article; zbMATH DE number 7194825 |
Statements
Exploiting sparsity for the min \(k\)-partition problem (English)
0 references
29 April 2020
0 references
integer programming
0 references
graph partitioning
0 references
semidefinite programming
0 references
chordal graph
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8001030087471008
0 references
0.7848391532897949
0 references
0.7787262797355652
0 references
0.7772400379180908
0 references
0.7690125107765198
0 references
