\(O(\sqrt{\log n})\) approximation to sparsest cut in \(\tilde{O}(n^2)\) time (Q3053148)
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 5810166
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(O(\sqrt{\log n})\) approximation to sparsest cut in \(\tilde{O}(n^2)\) time |
scientific article; zbMATH DE number 5810166 |
Statements
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time (English)
0 references
4 November 2010
0 references
graph partitioning
0 references
expander flows
0 references
multiplicative weights
0 references
sparsest cut problem
0 references
balanced separator problem
0 references
0.8713970184326172
0 references
0.8712918162345886
0 references
0.8691815733909607
0 references
0.8646084070205688
0 references
0.8433964848518372
0 references
