SDP primal-dual approximation algorithms for directed hypergraph expansion and sparsest cut with product demands (Q1791038)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: SDP primal-dual approximation algorithms for directed hypergraph expansion and sparsest cut with product demands |
scientific article; zbMATH DE number 6946827
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | SDP primal-dual approximation algorithms for directed hypergraph expansion and sparsest cut with product demands |
scientific article; zbMATH DE number 6946827 |
Statements
SDP primal-dual approximation algorithms for directed hypergraph expansion and sparsest cut with product demands (English)
0 references
4 October 2018
0 references
