$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time (Q3053148)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | $O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time |
scientific article |
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
