Semidefinite programming based algorithms for the sparsest cut problem (Q4917216)
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 6159178
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8045058846473694
0 references
0.7963567972183228
0 references
0.7957592010498047
0 references
0.7881156802177429
0 references
0.7848937511444092
0 references
