An O ( n ) -approximation algorithm for directed sparsest cut

We give an O ( n ) -approximation algorithm for the Sparsest Cut Problem on directed graphs. A naïve reduction from Sparsest Cut to Minimum Multicut would only give an approximation ratio of O ( n log D ) , where D is the sum of the demands. We obtain the improvement using a novel LP-rounding method...

Ausführliche Beschreibung