An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut (Q1045922)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut |
scientific article |
Statements
An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut (English)
0 references
18 December 2009
0 references
approximation algorithms
0 references
directed graphs
0 references
sparsest cut
0 references
multicommodity flow
0 references
0 references
0 references
