Semidefinite Programming Based Algorithms for the Sparsest Cut Problem (Q4917216): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SDPA / rank | |||
Normal rank | |||
Revision as of 16:49, 28 February 2024
scientific article; zbMATH DE number 6159178
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semidefinite Programming Based Algorithms for the Sparsest Cut Problem |
scientific article; zbMATH DE number 6159178 |
Statements
Semidefinite Programming Based Algorithms for the Sparsest Cut Problem (English)
0 references
29 April 2013
0 references
semidefinite programming
0 references
sparsest cut
0 references
combinatorics
0 references
