An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut (Q1045922)
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: An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut |
scientific article; zbMATH DE number 5650190
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut |
scientific article; zbMATH DE number 5650190 |
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
0 references
0 references
0.92147887
0 references
0.92143846
0 references
0.91383773
0 references
0.9039867
0 references
0.8987624
0 references
0.8972519
0 references
0.89654016
0 references
0.8956343
0 references
0.8955448
0 references
